On non-preemptive scheduling of period and sporadic tasks

A fundamental problem in the theory of real-time scheduling is examined: scheduling a set of periodic or sporadic tasks on a uniprocessor without preemption and without inserted idle time. The authors give a necessary and sufficient set of conditions C for a set of periodic or sporadic tasks to be schedulable for arbitrary release times of the tasks. They show that any set of periodic or sporadic tasks that satisfies C can be scheduled with an earliest-deadline-first (EDF) scheduling algorithm. The authors present the scheduling model, briefly review the literature in real-time scheduling, prove that the non-preemptive EDF algorithm is universal for sets of tasks, whether periodic or sporadic, and demonstrate the absence of a universal algorithm for periodic tasks with specified release times. It is proved that the problem of deciding schedulability of a set of concrete periodic tasks is intractable.<<ETX>>

[1]  M. R. Harris,et al.  Exploring Virtual Worlds With Head-Mounted Displays , 1989, Photonics West - Lasers and Applications in Science and Engineering.

[2]  Sudarshan K. Dhall,et al.  On a Real-Time Scheduling Problem , 1978, Oper. Res..

[3]  Charles U. Martel,et al.  Scheduling Periodically Occurring Tasks on Multiple Processors , 1981, Inf. Process. Lett..

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  Kevin Jeffay,et al.  The real-time producer/consumer paradigm: towards verifiable real time computations , 1989 .

[6]  Aloysius Ka-Lau Mok,et al.  Fundamental design problems of distributed systems for the hard-real-time environment , 1983 .

[7]  Joseph Y.-T. Leung,et al.  On the complexity of fixed-priority scheduling of periodic, real-time tasks , 1982, Perform. Evaluation.

[8]  Alan A. Bertossi,et al.  Preemptive Scheduling of Periodic Jobs in Uniform Multiprocessor Systems , 1983, Inf. Process. Lett..

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

[10]  Paul Gordon Sorenson,et al.  A methodology for real-time system development. , 1974 .

[11]  Kevin Jeffay,et al.  Scheduling sporadic tasks with shared resources in hard-real-time systems , 1992, [1992] Proceedings Real-Time Systems Symposium.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Greg N. Frederickson,et al.  Scheduling Unit-Time Tasks With Integer Release Times and Deadlines , 1983, Inf. Process. Lett..

[14]  Robert E. Tarjan,et al.  Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines , 1981, SIAM J. Comput..

[15]  Kevin Jeffay The real-time producer/consumer paradigm: a paradigm for the construction of efficient, predictable real-time systems , 1993, SAC '93.

[16]  Kevin Jeffay Analysis of a synchronization and scheduling discipline for real-time tasks with preemption constraints , 1989, [1989] Proceedings. Real-Time Systems Symposium.

[17]  Paul G. Sorenson,et al.  A Real-Time System Design Methodology* , 1975 .

[18]  J. Leung,et al.  A Note on Preemptive Scheduling of Periodic, Real-Time Tasks , 1980, Inf. Process. Lett..