Skip to main content
SpringerLink
Log in
Book cover

Virtuelle Maschinen pp 65–96Cite as

Virtual Machine Dispatching under Fairness Constraints

  • Chapter

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 18))

Abstract

The paper analyzes the problems of low level dispatching under predictability constraints, with good responsiveness and low overhead. It is shown that nonpreemptive and/or round-robin disciplines fail for the general case. A novel algorithm is proposed based on sorting at time slice intervals. Simulation results are used to discuss the properties of the new dispatching algorithm.

This is a preview of subscription content, 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   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature

  1. IBM Virtual Machine Facility /370: CMS User’s Guide. Form-No. GC20–1819, IBM Corporation, White Plains, N. Y.

    Google Scholar 

  2. Coffman, E.G. and Denning, P.J.: Operating Systems Theory. Englewood CLiffs, New Jersey: Prentice Hall, 1973.

    Google Scholar 

  3. Hoare, C.A.R. and Perrot, R.H. (eds.): Operating Systems Techniques. Proceedings of a Seminar at Queens University, Belfast, 1971. London and New York: Academic Press, 1972.

    Google Scholar 

  4. Smith, C.H. and Wittie, L.: Discriminating Content Addressable Memories. In: Feng, T. (ed.): Parallel Processing, Proceedings of the Sagamore Computer Conference, August 20–23, 1974. Lecture Notes in Computer Science 24. Berlin-Heidelberg-New York: Springer, 1975, p. 100–102.

    Google Scholar 

  5. Sherman, S., Baskett III, F. and Browne, J.C.: Trace-Driven Modeling and Analysis of CPU Scheduling in a Multiprogramming System. Comm. ACM 15, 1063–1069 (1972).

    Article  Google Scholar 

  6. Chen, T.C., Lum, V.Y. and Tung, C: The Rebound Sorter: An Efficient Sort Engine for Large Files. IBM Research Laboratory, San Jose, California, Rep. RJ 2204, March 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IBM Deutschland GmbH, Scientific Center Heidelberg, Deutschland

    H. Schmutz, H. Eberle & K. F. Finkemeyer

Authors
  1. H. Schmutz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Eberle
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. F. Finkemeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Technische Universität München, Postfach 20 24 20, 8000, München 2, Deutschland

    H. J. Siegert

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin · Heidelberg

About this chapter

Cite this chapter

Schmutz, H., Eberle, H., Finkemeyer, K.F. (1979). Virtual Machine Dispatching under Fairness Constraints. In: Siegert, H.J. (eds) Virtuelle Maschinen. Informatik-Fachberichte, vol 18. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67415-0_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-67415-0_6

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-67415-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation