Skip to main content
SpringerLink
Log in

Cello: A Disk Scheduling Framework for Next Generation Operating Systems*

  • Published:
Real-Time Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abbott, R. K., and Garcia-Molina, H. 1990. Scheduling I/O requests with deadlines: A performance evaluation. In Proceedings of RTSS, pp. 113-124.

  2. Anderson, D., Osawa, Y., and Govindan, R. 1992. A file system for continuous media. ACM Transactions on Computer Systems 10(4): 311-337.

    Google Scholar 

  3. Barham, P. 1992. A fresh approach to file system quality of service. In Proceedings of NOSSDAV'97, St. Louis, Missouri, pp. 119-128.

  4. Bennett, J. C. R., and Zhang, H. 1996. Hierarchical packet fair queuing algorithms. In Proceedings of SIGCOMM'96. pp. 143-156.

  5. Bruno, J., Gabber, E., Ozden, B., and Silberschatz, A. 1999. Disk scheduling with quality of service guarantees. In Proceedings of the IEEE Conference on Multimedia Computing Systems (ICMCS'99)

  6. Buddhikot, M., Chen, X., Wu, D., and Parulkar, G. 1998. Enhancements to 4.4 BSD UNIX for efficient networked multimedia in project MARS. In Proceedings of the IEEE International Conference on Multimedia Computing and Systems (ICMCS'98), Austin, TX, pp. 326-337.

  7. Carey, M. J., Jauhari, R., and Linvy, M. 1989. Priority in DBMS resource scheduling. In Proceedings of the 15th VLDB Conference.

  8. Chen, S., Stankovic, J. A., Kurose, J. F., and Towsley, D. 1991. Performance evaluation of two new disk scheduling algorithms for real-time systems. Journal of Real-Time Systems 3: 307-336.

    Google Scholar 

  9. Coffman, E. G., and Hofri, M. 1982. On the expected performance of scanning disks. SIAM Journal of Computing 10(1): 60-70.

    Google Scholar 

  10. Coffman, E. G., Klimko, L. A., and Ryan, B. 1972. Analysis of scanning policies for reducing disk seek times. SIAM Journal of Computing 1(3): 269-279.

    Google Scholar 

  11. Denning, P. J. 1967. Effects of scheduling on file memory operations. In Proceedings of AFIPS SJCC, pp. 9-21.

  12. Geist, R., and Daniel, S. 1987. A continuum of disk scheduling algorithms. ACM Transactions on Computer Systems, 5(1): 77-92.

    Google Scholar 

  13. Goyal, P., Vin, H. M., and Cheng, H. 1996. Start-time fair queuing: A scheduling algorithm for integrated services packet switching networks. In Proceedings of ACM SIGCOMM'96 pp. 157-168.

  14. Hofri, M., 1980. Disk Scheduling: FCFS vs. SSTF Revisited. Communications of the ACM, 23(11): 645-653.

    Google Scholar 

  15. Jacobson, D. M., and Wilkes, J., 1991. Disk Scheduling Algorithms Based on Rotational Position. Technical report, Hewlett Packard Labs.

  16. Jones, M. B., Leach, P., Draves, R., and Barrera, J. 1995. Support for user-centric modular real-time resource management in Rialto operating system. In Proceedings of NOSSDAV'95, Durham, New Hampshire.

  17. Lee, E. K., and Katz, R. H. 1993. An analytic performance model for disk arrays. In Proceedings of the 1993 ACM SIGMETRICS, pp. 98-109.

  18. Lehoczky, J. P., and Ramos-Thuel, S. 1992. An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems. In Proceedings of Real Time Systems Symposium, pp. 110-123.

  19. Liu, C. L., and Layland, J. W. 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of the ACM 30: 47-61.

    Google Scholar 

  20. Molano, A., Juvva, K., and Rajkumar, R. 1997. Real-time file systems: guaranteeing timing constraints for disk accesses in RT-Mach. In Proceedings of IEEE Real-time Systems Symposium.

  21. Nieh, J., and Lam, M. S. 1997. The design, implementation and evaluation of SMART: a scheduler for multimedia applications. In Proceedings of the sixteenth ACM symposium on Operating systems principles (SOSP'97), Saint-Malo, France, pp. 184-197.

  22. Narasimha Reddy, A. L., and Wyllie, J. 1993. Disk scheduling in multimedia I/O system. In Proceedings of ACM Multimedia'93, Anaheim, CA, pp. 225-234.

  23. Seltzer, M., Chen, P., and Ousterhout, J. 1990. Disk scheduling revisited. In Proceedings of the 1990 Winter USENIX Conference, Washington, DC, pp. 313-323.

  24. Shenoy, P. 1998. Symphony: an integrated multimedia file system. PhD thesis, The University of Texas at Austin, Austin, TX.

    Google Scholar 

  25. Shenoy, P. J., Goyal, P., Rao, S. S., and Vin, H. M. 1998. Symphony: an integrated multimedia file system. In Proceedings of the SPIE/ACM Conference on Multimedia Computing and Networking (MMCN'98), San Jose, CA, pp. 124-138.

  26. Teorey, T., and Pinkerton, T. B. 1972. A comparative analysis of disk scheduling policies. Communications of the ACM 15(3): 177-184.

    Google Scholar 

  27. Wijayaratne, R., and Reddy, A. L. N. 1997. Providing QoS guarantees for disk I/O. Technical Report TAMU-ECE97-02, Department of Electrical Engineering, Texas A &M University.

  28. Wilhelm, N. C. 1976. An anomaly in disk scheduling: A comparison of FCFS and SSTF seek scheduling using and empirical model for disk access. Communications of the ACM 19(1): 13-17.

    Google Scholar 

  29. Worthington, B. L., Ganger, G. R., and Patt, Y. N. 1994. Scheduling algorithms for modern disk drives. In Proceedings of ACM SIGMETRICS'94, pp. 241-251.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Massachusetts at Amherst, Amherst, MA, 01003

    Prashant Shenoy

  2. Department of Computer Sciences, University of Texas at Austin, Austin, TX, 78712

    Harrick M. Vin

Authors
  1. Prashant Shenoy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Harrick M. Vin
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shenoy, P., Vin, H.M. Cello: A Disk Scheduling Framework for Next Generation Operating Systems*. Real-Time Systems 22, 9–48 (2002). https://doi.org/10.1023/A:1013437003242

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1013437003242

Search

Navigation