A unifying approach to scheduling

This paper presents a scheme for classifying scheduling algorithms based on an abstract model of a scheduling system which formalizes the notion of priority. Various classes of scheduling algorithms are defined and related to existing algorithms. A criterion for the implementation efficiency of an algorithm is developed and results in the definition of time-invariant algorithms, which include most of the commonly implemented ones. For time-invariant algorithms, the dependence of processing rates on priorities is derived. The abstract model provides a framework for implementing flexible schedulers in real operating systems. The policy-driven scheduler of Bernstein and Sharp is discussed as an example of

[1]  Edward G. Coffman,et al.  Analysis of Two Time-Sharing Algorithms Designed for Limited Swapping , 1968, JACM.

[2]  Arthur J. Bernstein,et al.  A policy-driven scheduler for a time-sharing system , 1971, CACM.

[3]  Martin Greenberger,et al.  The Priority Problem and Computer Time Sharing , 1966 .

[4]  Linus Schrage,et al.  The Queue M/G/1 With Feedback to Lower Priority Queues , 1967 .

[5]  Edward G. Coffman,et al.  Computer scheduling methods and their countermeasures , 1968, AFIPS Spring Joint Computing Conference.

[6]  Leonard Kleinrock,et al.  Time-shared Systems: a theoretical treatment , 1967, JACM.

[7]  Leonard Kleinrock,et al.  Tight Bounds on the Average Response Time-Shared Computer Systems , 1971, IFIP Congress.

[8]  Arthur J. Bernstein,et al.  Analysis of a Feedback Scheduler , 1974, SIAM J. Comput..

[9]  Edward G. Coffman,et al.  Feedback Queueing Models for Time-Shared Systems , 1968, J. ACM.

[10]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[11]  Leonard Kleinrock,et al.  A contiuum of time-sharing scheduling algorithms , 1970, AFIPS '70 (Spring).

[12]  Arie Shoshani,et al.  System Deadlocks , 1971, CSUR.

[13]  Hugh W. Lynch,et al.  The OS/VS2 Release 2 System Resources Manager , 1974, IBM Syst. J..

[14]  J. Wolfowitz.  Review: William Feller, An introduction to probability theory and its applications. Vol. I , 1951 .

[15]  J. M. McKinney,et al.  A Survey of Analytical Time-Sharing Models , 1969, CSUR.

[16]  Leonard Kleinrock,et al.  A delay dependent queue discipline , 1964 .