In this paper, we present the Cello disk scheduling framework for meeting the diverse
service requirements of applications. Cello employs a two-level disk scheduling architecture …

In embedded systems and laptops, flash memory storage such as SSDs (Solid State Drive)
have been gaining popularity due to its low energy consumption and durability. As SSDs are …

Disk schedulers in current operating systems are generally work-conserving, ie, they
schedule a request as soon as the previous request has finished. Such schedulers often …

Garbage collection (GC) and resource contention on I/O buses (channels) are among the
critical bottlenecks in Solid State Disks (SSDs) that cannot be easily hidden. Most existing …

We examine whether traditional disk I/O scheduling still provides benefits in a layered
system consisting of virtualized operating systems and underlying virtual machine monitor …

The paper introduces YFQ, a new disk scheduling algorithm that allows applications to set
aside for exclusive use portions of the disk bandwidth. We implemented YFQ as part of the …

Guaranteed I/O performance is needed for a variety of applications ranging from real-time
data collection to desktop multimedia to large-scale scientific simulations. Reservations on …

To reduce the performance penalty incurred by seeking a drive head, operating system
Software (and drive firmware) traditionally reorder I/O packets to minimize seek time. Much …

Mainstream applications-such as file copy/transfer, Web, DBMS, or video streaming-typically
issue synchronous disk requests. As shown in this paper, this fact may cause work …

Cake is a coordinated, multi-resource scheduler for shared distributed storage environments
with the goal of achieving both high throughput and bounded latency. Cake uses a two-level …