On the optimality of minimum laxity and earliest deadline scheduling for real-time multiprocessors

The problem of scheduling jobs with real-time constraints on a multiprocessor is considered. If a job does not complete within a certain time interval of its arrival to such a system, it is considered useless and need not be served. It is therefore desirable to schedule jobs so that the fraction of jobs served within their respective deadlines is maximized. Such a system is modeled as a multiple server queue. It is shown, for a variety of systems, that the minimum laxity (ML) policy maximizes the fraction of jobs that successfully complete service when jobs must begin service by their deadline, and that the earliest deadline policy does the same for wide class of systems when jobs must complete service by their deadlines. Results are given for unreliable multiprocessors and multiprocessors that serve several priority classes of jobs.<<ETX>>

[1]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[2]  James W. Layland,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[3]  Michael L. Dertouzos,et al.  Control Robotics: The Procedural Control of Physical Processes , 1974, IFIP Congress.

[4]  Don Towsley,et al.  Comparisons of service disciplines in a tandem queueing network with real time constraints , 1991, Oper. Res. Lett..

[5]  F. Baccelli,et al.  Single-server queues with impatient customers , 1984, Advances in Applied Probability.

[6]  William P. Pierskalla,et al.  Optimal Issuing Policies for Perishable Inventory , 1972 .

[7]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[8]  Donald F. Towsley,et al.  A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System , 1989, IEEE Trans. Computers.

[9]  Don Towsley,et al.  Optimal scheduling policies for a class of Queues with customer deadlines to the beginning of service , 1990, PERV.

[10]  P. Brémaud.  Point Processes and Queues , 1981 .

[11]  Jean C. Walrand,et al.  Dynamic priority protocols for packet voice , 1989, IEEE J. Sel. Areas Commun..

[12]  Edward G. Coffman,et al.  Computer and job-shop scheduling theory , 1976 .

[13]  Chung Laung Liu,et al.  Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment , 1989, JACM.

[14]  Michael Pinedo,et al.  Stochastic Scheduling with Release Dates and Due Dates , 1983, Oper. Res..

[15]  J. W. Cohen,et al.  Single server queues with restricted accessibility , 1969 .

[16]  P. Brémaud.  Point processes and queues, martingale dynamics , 1983 .

[17]  J. M. Moore.  An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs , 1968 .

[18]  Kenneth C. Sevcik,et al.  A Combinatorial Approach to Dynamic Scheduling Problems , 1978, Oper. Res..

[19]  Bharat T. Doshi,et al.  Comparisons of Service Disciplines in a Queueing System with Delay Dependent Customer Behaviour , 1982 .

[20]  D. Towsley,et al.  Comparison of Service and Buffer Overflow Policies for Multiple Server , 1989 .

[21]  Y. Lim,et al.  Analysis of a delay-dependent priority discipline in a multi-class traffic packet switching node , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[22]  Bezalel Gavish,et al.  The Markovian Queue with Bounded Waiting time , 1977 .