Summary
The concept of a family of scheduling strategies in which a few parameters may be varied to achieve different performance levels is introduced. The use of such families in satisfying performance requirements stated in terms of average response times for jobs of different classes is studied. A performance requirement is said to be achievable if, given the loading conditions on the system, there exists a scheduling strategy which satisfies it. A family of scheduling strategies is said to be complete if every achievable performance requirement can be satisfied by a strategy from the family. Sufficient conditions for a parameterized family to be complete are proven.
Three parameterized families are discussed, one in detail. Completeness of the three families is demonstrated and simulation results illustrating some properties of implementation are presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Coffman, E.G., Mitrani, I.: Selecting a scheduling rule that meets pre-specified response time demands. Proceedings 5th Symposium on Operating Systems Principles, Austin (1975)
Coffman, E.G., Mitrani, I.: Private Communications
Kleinrock, L.: A conservation law for a wide class of queueing disciplines. Naval Research Logistics Quarterly 12, 181–192 (1965)
Kleinrock, L.: Time-shared systems: A theoretical treatment. J. ACM 14, 242–261 (1967)
Newman, M.H.A.: Topology of plane sets. Cambridge: Cambridge Press 1951
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Mitrani, I., Hine, J.H. Complete parameterized families of job scheduling strategies. Acta Informatica 8, 61–73 (1977). https://doi.org/10.1007/BF00276184
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00276184