Skip to main content
SpringerLink
Log in

Extending a Best-Effort Operating System to Provide QoS Processor Management

  • Conference paper
  • First Online:
Quality of Service — IWQoS 2001 (IWQoS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2092))

Included in the following conference series:

Abstract

The benefits of QoS network features are easily lost when the endnodes are managed by a conventional, best-effort operating system. Schedulers of such operating systems provide only rudimentary tools (like priority adjustment) for processor management. We present here a simple extension to a processor management system that allows an application to reserve a share of the processor for a specified interval. The system is targeted at applications with frequently changing resource demands or recurring, though non-periodic resource requests. An example of such an application is a network-aware image search and retrieval system, but other network-aware client-server applications also fall into the same category. The admission control component of the processor management system decides if a resource request can be satisfied. To limit the amount of time spent negotiating with the operating system, the application can present a ranked list of acceptable reservations. The admission controller then picks the best request that can still be satisfied (using the Simplex linear programming algorithm to find the best solution). If there are insufficient resources, the application must deal with the shortage. Any possible adaptation (if the accepted request was not the application’s first choice) is left to the application. The processor management system has been implemented for NetBSD and been ported to Linux, and the paper includes an evaluation of its effectiveness. The overhead is low, and although reservations are not guaranteed, in practical settings the application almost always obtains the cycles requested.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. F. Arlitt and C. L. Williamson. Internet web servers: Workload characterization and performance implications. IEEE/ACM Transactions on Networking, 5(5):631–645, Oct. 1997.

    Article  Google Scholar 

  2. M. J. Bach. The Design of the UNIX Operating System. Prentice Hall, 1986.

    Google Scholar 

  3. M. Baker-Harvey. ETI resource distributor: Guaranteed resource allocation and scheduling in multimedia systems. In Proceedings of the Third Symposium on Operating Systems Design and Implementation (OSDI’ 99), pages 131–144, Feb. 1999.

    Google Scholar 

  4. A. C. Bavier, A. B. Montz, and L. L. Peterson. Predicting MPEG execution times. In Proceedings of the SIGMETRICS’ 98/PERFORMANCE’ 98 Joint International Conference on Measurement and modeling of Computers Systems, June 22–26, 1998; Madison WI, pages 131–140, May 1998.

    Google Scholar 

  5. N. Bhatti, A. Bouch, and A. Kuchinsky. Integrating user-perceived quality into web server design. Technical Report HPL-2000-3, Internet Systems and Applications Laboratory, HP Laboratories Palo Alto, Jan. 2000.

    Google Scholar 

  6. J. Bolliger. A framework for network-aware applications. PhD thesis, ETH Zürich, Apr. 2000. No. 13636.

    Google Scholar 

  7. J. Bolliger and T. Gross. A framework-based approach to the development of networkaware applications. IEEE Transactions on Software Engineering (Special Issue on Mobility and Network-Aware Computing, 24(5):376–390, May 1998.

    Google Scholar 

  8. R. L. Carter and M. E. Crovella. Dynamic server selection using bandwidth probing in wide-area networks. Technical Report BU-CS-96-007, Computer Science Department, Boston University; 111 Cummington St., Boston MA 02215, Mar. 1996.

    Google Scholar 

  9. J. Dilley. Web server workload characterization. Technical Report HPL-96-160, Hewlett-Packard Laboratories, Dec. 1996.

    Google Scholar 

  10. H. Domjan and T. R. Gross. Providing resource reservations for adaptive applications in a best-effort operating system. Technical report, ETH Zürich, Feb. 2001.

    Google Scholar 

  11. B. Goodheart and J. Cox. The Magic Garden explained: the Internals of UNIX System V Release 4, an Open-Systems design. Prentice Hall, 1993.

    Google Scholar 

  12. P. Goyal, X. Guo, and H. M. Vin. A hierarchical CPU scheduler for multimedia operating systems. In Proceedings of the Second USENIX Symposium on Operating Systems Design and Implementation (OSDI). 28–31 Oct. 1996; Seattle, WA, USA, pages 107–121, Oct. 1996.

    Google Scholar 

  13. M. Harchol-Balter and A. B. Downey. Exploiting process lifetime distributions for dynamic load balancing. In Proceedings of the 1996 ACM SIGMETRICS Conference, pages 13–23, 1996.

    Google Scholar 

  14. M. B. Jones, D. Roşu, and M.-C. Roşu. Cpu reservations and time constraints: Efficient, predictable scheduling of independent activities. In Proceedings of the Sixteenth ACM Symposium on Operating System Principles (SOSP-16), Saint-Malo, France, October 5–8, pages 198–211, Oct. 1997.

    Google Scholar 

  15. C. L. Liu and J. W. Layland. Scheduling algorithms for multiprogramming in a hard-realtime environment. Journal of the Association of Computing Machinery, 20(1):46–61, Jan. 1973.

    MATH  MathSciNet  Google Scholar 

  16. M. K. McKusick, K. Bostic, M. J. Karels, and J. S. Quarterman. The Design and Implementation of the 4.4BSD Operating System. Addison-Wesley Publishing Company, 1996.

    Google Scholar 

  17. C. W. Mercer. Operating System Resource Reservation for Real-Time and Multimedia Applications. PhD thesis, School of Computer Science, Carnegie Mellon University Pittsburgh, PA 15213-3890, June 1997.

    Google Scholar 

  18. C. W. Mercer, S. Savage, and H. T okuda. Processor capacity reserves: An abstraction for managing processor usage. In Proceedings of the Fourth Workshop on Workstation Operating Systems, Oct. 1993.

    Google Scholar 

  19. C. W. Mercer, S. Savage, and H. Tokuda. Processor capacity reserves: Operating system support for multimedia applications. In Proceedings of the IEEE International Conference on Multimedia Computing and Systems, pages 90–99, May 1994.

    Google Scholar 

  20. A. Mukherjee. On the dynamics and significance of low frequency components of internet load. Internetworking: Practice and Experience, 5(4):163–205, Dec. 1994.

    Google Scholar 

  21. J. Nieh and M. Lam. The design, implementation and evaluation of SMART: A scheduler for multimedia applications. In Proceedings of the 16th ACM Symposium on Operating System Principles, St. Malo, October 1997, pages 184–197, Oct. 1997.

    Google Scholar 

  22. K. Patel, B. C. Smith, and L. A. Rowe. Performance of a software MPEG video decoder. In Proceedings of the First International Conference on Multimedia; 1–6 August 1993; Anaheim, CA, USA, pages 75–82. ACM, Aug. 1993.

    Google Scholar 

  23. D. M. Ritchie and K. Thompson. The UNIX time-sharing system. Communications of the ACM, 17(7):365–375, July 1974.

    Article  Google Scholar 

  24. L. Sha, R. Rajkumar, and J. P. Lehoczky. Priority inheritance protocols: An approach to real-time synchronization. IEEE Transactions on Computers, 39(9):1175–1185, Sept. 1990.

    Article  MathSciNet  Google Scholar 

  25. B. Sprunt, L. Sha, and J. Lehoczky. Aperiodic task scheduling for hard-real-time systems. The Journal of Real-Time Systems, 1(1):27–60, June 1989.

    Article  Google Scholar 

  26. I. Stoica, H. Abdel-Wahab, K. Jeffay, S. K. Baruah, J. E. Gehrke, and C. G. Plaxton. A proportional share resource allocation algorithm for real-time, time-shared systems. In Proceedings of the 17th IEEE Real-Time Systems Symposium, pages 288–299, Dec. 1996.

    Google Scholar 

  27. C. A. Waldspurger and W. E. Weihl. Lottery scheduling: Flexible proportional-share resource management. In Proceedings of the First Symposium on Operating Systems Design and Implementation, pages 1–11, 1994.

    Google Scholar 

  28. C. A. Waldspurger and W. E. Weihl. Stride scheduling: Deterministic proportional-share resource management. Technical Memorandum MIT/LCS/TM-528, MIT Laboratory for Computer Science, Cambridge, MA 02139, June 1995.

    Google Scholar 

  29. R. Weber, J. Bolliger, T. Gross, and H.-J. Schek. Architecture of a networked image search and retrieval system. In Proceedings of the ACM Conference on Information and Knowledge Management (CIKM’99), pages 430–441, Nov. 1999.

    Google Scholar 

  30. L. C. Wolf. Handbook of Multimedia Computing, chapter Resource Management in Multimedia Systems, pages 891–912. CRC Press, Boca Raton, FL, USA, 1998.

    Google Scholar 

  31. L. C. Wolf, L. Delgrossi, R. Steinmetz, S. Schaller, and H. Wittig. Issues of reserving resources in advance. In Proceedings of the Fifth International Workshop on Network and Operating System Support for Digital Audio and Video; April 19–21, 1995; Durham, New Hampshire, USA, Apr. 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department Informatik ETH Zürich, CH-8092, Zürich

    Hans Domjan & Thomas R. Gross

Authors
  1. Hans Domjan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas R. Gross
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics and Computing Center Institute of Telematics, University of Karlsruhe, Zirkel 2, 76128, Karlsruhe, Germany

    Lars Wolf

  2. Faculty of Applied Sciences, Computing Department, Lancaster University, Lancaster, LA1 4YR, UK

    David Hutchison

  3. GMD IPSI, German National Research Center for Information Technology Integrated Publication and Information Systems, Dolivostr. 15, 64293, Darmstadt, Germany

    Ralf Steinmetz

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Domjan, H., Gross, T.R. (2001). Extending a Best-Effort Operating System to Provide QoS Processor Management. In: Wolf, L., Hutchison, D., Steinmetz, R. (eds) Quality of Service — IWQoS 2001. IWQoS 2001. Lecture Notes in Computer Science, vol 2092. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45512-4_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-45512-4_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42217-4

  • Online ISBN: 978-3-540-45512-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation