Abstract

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, consisting of a class-independent scheduler and a set of class-specific schedulers. The two levels of the framework allocate disk bandwidth at two time-scales: the class-independent scheduler governs the coarse-grain allocation of bandwidth to application classes, while the class-specific schedulers control the fine-grain interleaving of requests. The two levels of the architecture separate application-independent mechanisms from application-specific scheduling policies, and thereby facilitate the co-existence of multiple class-specific schedulers. We demonstrate that Cello is suitable for next generation operating systems since: (i) it aligns the service provided with the application requirements, (ii) it protects application classes from one another, (iii) it is work-conserving and can adapt to changes in work-load, (iv) it minimizes the seek time and rotational latency overhead incurred during access, and (v) it is computationally efficient.

Keywords

Computer scienceScheduling (production processes)InterleavingHard disk drive performance characteristicsLatency (audio)ArchitectureDistributed computingBounding overwatchProcessor schedulingCelloScheduleOperating systemEngineeringArtificial intelligence

Affiliated Institutions

Related Publications

Dryad

Dryad is a general-purpose distributed execution engine for coarse-grain data-parallel applications. A Dryad application combines computational "vertices" with communication "ch...

2007 2446 citations

Publication Info

Year
1998
Type
article
Pages
44-55
Citations
211
Access
Closed

External Links

Social Impact

Altmetric
PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

211
OpenAlex

Cite This

Prashant Shenoy, Harrick M. Vin (1998). Cello. , 44-55. https://doi.org/10.1145/277851.277871

Identifiers

DOI
10.1145/277851.277871