Skip to main content
Log in

Heterogeneous CPU Services Using Differentiated Admission Control

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

We present an adaptive rate-controlled scheduler for heterogeneous applications running on general purpose computers. Our scheduler can effectively support diverse application requirements. It employs uniform rate-based sharing. Application heterogeneity is satisfied by partitioning CPU capacity into service classes, each with a different criterion for admission control. As a result, we are able to provide at once guaranteed performance, flexible allocation of rates with excellent scalability and intermediate service classes offering tradeoffs between reserved rate utilization and the strength of guarantees. Our scheduler has been implemented in Solaris 2.5.1. It runs existing applications without modifications. We present experimental results showing the scalability, efficiency, guaranteed performance, and overload performance aspects of our scheduler. We demonstrate the importance of priority inheritance implemented in our scheduler for stable system performance.

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

Access this article

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. L. Alger and J. Lala, “Real-time operating system for a nuclear power plant computer,” in Proc. Real-Time Systems Symposium, Dec. 1986.

  2. J.A. Cobb, M.G. Gouda, and A. El-Nahas, “Time-shift scheduling-fair scheduling of flows in high speed networks,” IEEE/ACM Trans Networking, Vol. 6, No. 3, pp. 274–285, 1998.

    Google Scholar 

  3. R.B. Essick, “An event-based fair share scheduler,” in Proc. 1990 Winter USENIX Conference, Washington D.C., Jan. 1990.

  4. B. Ford and S. Susarla, “CPU inheritance scheduling,” in Proc. 2nd USENIX OSDI, Oct. 1996.

  5. R. Gopalakrishnan and G.M. Parulkar, “Efficient user space protocol implementations with QoS guarantees using real-time upcalls,” IEEE/ACM Transactions on Networking, Vol. 6, No. 4, 1998.

  6. P. Goyal, X. Guo, and H.M. Vin, “A hierarchical CPU scheduler for multimedia operating systems,” in Proc. of 2nd USENIX OSDI, 1996.

  7. G.J. Henry, “The fair share scheduler,” AT&T Bell Labs Technical Journal, Vol. 63, No. 8, 1984.

  8. K. Jeffay and D. Bennett, “A rate-based execution abstraction for multimedia computing,” in Proc. 5th International Workshop on Network and Operating System Support for Digital Audio and Video, Durham, NH, April 1995.

  9. S. Khanna, M. Sebree, and J. Zolnowsky, “Real-time scheduling in SunOS 5.0,” in Proc.Winter 1992 USENIX Conference, San Francisco, CA, Jan. 1992.

  10. C. Lee, R. Rajkumar, and C. Mercer, “Experiences with processor reservation and dynamic QoS in real-time Mach,” in Proc. Multimedia Japan, April 1996.

  11. C.L. Liu and J.W. Layland, “Scheduling algorithms for multiprogramming in a hard real time environment,” JACM, Vol. 20, No. 1, pp. 46–61, 1973.

    Google Scholar 

  12. C.W. Mercer, S. Savage, and H. Tokuda, “Processor capacity reserves: Operating system support for multimedia applications,” in Proc. IEEE Int'l Conf on Multimedia Computing and Systems, Boston, MA, May 1994.

  13. J. Nieh and M. Lam, “The design, implementation and evaluation of SMART: A scheduler for multimedia applications,” in Proc. of 16th ACM Symp. on Operating System Principles, Cannes, France, Nov. 1997.

  14. QNX Software Systems Ltd. http://www.qnx.com.

  15. R. Steinmetz, “Analyzing the multimedia operating system,” IEEE Multimedia Magazine, Vol. 2, No. 1, pp. 68–84, 1995.

    Google Scholar 

  16. S. Suri, G. Varghese, and G. Chandranmenon, “Leap forward virtual clock: A new fair queueing scheme with guaranteed delays and throughput fairness,” in Proc. IEEE Infocom 97, Kobe, Japan, April 1997.

  17. H. Tokuda, T. Nakajima, and P. Rao, “Real-time mach: Toward a predictable real-time system,” in Proc. USENIX Mach Workshop, Oct. 1990.

  18. C. Waldspurger and W. Weihl, “Lottery scheduling: Flexible proportional-share resource management,” in Proc. of ACM Symp. on Operating System Design and Implementation, Nov. 1994.

  19. C. Waldspurger and W. Weihl, “Stride scheduling: Deterministic proportional-share resource management,” Technical Report TM-528, MIT, Laboratory for Computer Science, June 1995.

  20. G.G. Xie and S.S. Lam, “Delay guarantee of virtual clock server,” IEEE/ACM Trans. on Networking, Vol. 3, No. 6, pp. 683–689, 1995.

    Google Scholar 

  21. D.K.Y. Yau, “ARC-H: Uniform CPU scheduling for heterogeneous services,” in Proc. IEEE International Conference on Multimedia Computing and Systems, Florence, Italy, June 1999.

  22. D.K.Y. Yau and S.S. Lam, “Adaptive rate-controlled scheduling for multimedia applications,” IEEE/ACM Transactions on Networking, Vol. 5, No. 4, 1997.

  23. D.K.Y. Yau and S.S. Lam, “Migrating sockets-end system support for networking with quality of service guarantees,” IEEE/ACM Transactions on Networking, Vol. 6, No. 6, 1998.

  24. L. Zhang, “VirtualClock: A new traffic control algorithm for packet switching networks,” ACM Transactions on Computer Systems, Vol. 9, No. 2, pp. 101–124, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yau, D.K., Bhargava, B. Heterogeneous CPU Services Using Differentiated Admission Control. Multimedia Tools and Applications 17, 213–232 (2002). https://doi.org/10.1023/A:1015729020363

Download citation

  • Issue Date:

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

Navigation