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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Literature
IBM Virtual Machine Facility /370: CMS User’s Guide. Form-No. GC20–1819, IBM Corporation, White Plains, N. Y.
Coffman, E.G. and Denning, P.J.: Operating Systems Theory. Englewood CLiffs, New Jersey: Prentice Hall, 1973.
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.
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.
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).
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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