, 4:209 | Cite as

A new algorithm for scheduling periodic, real-time tasks

  • Joseph Y. -T. Leung


We consider the problem of preemptively scheduling a set of periodic, real-time tasks on a multiprocessor computer system. We give a new scheduling algorithm, the so-called Slack-Time Algorithm, and show that it is more effective than the known Deadline Algorithm. We also give an (exponential-time) algorithm to decide if a task system is schedulable by the Slack-Time or the Deadline Algorithm. The same algorithm can also be used to decide if a task system is schedulable by any given fixed-priority scheduling algorithm. This resolves an open question posed by Leung and Whitehead. Finally, it is shown that the problem of deciding if a task system is schedulable by the Slack-Time, the Deadline, or any given fixed-priority scheduling algorithm is co-NP-hard for each fixedm≥.

Key words

Periodic Real-time tasks Multiprocessor system Schedulability co-NP-hard 


  1. [1]
    E. G. Coffman, Jr. and P. J. Denning,Operating Systems Theory, Prentice-Hall, Englewood Cliffs, NJ, 1973.Google Scholar
  2. [2]
    S. K. Dhall and C. L. Liu, On a Real-Time Scheduling Problem,Operations Research, Vol. 26, No. 1, 1978, pp. 127–140.zbMATHMathSciNetCrossRefGoogle Scholar
  3. [3]
    J. Labetoulle, Some Theorems on Real Time Scheduling, inComputer Architecture and Networks, E. Gelenbe and R. Mahl (eds.), North-Holland, Amsterdam, 1974, pp. 285–293.Google Scholar
  4. [4]
    E. L. Lawler and C. U. Martel, Scheduling Periodically Occurring Tasks on Multiple Processors,Information Processing Letters, Vol. 12, No. 1, 1981, pp. 9–12.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [5]
    J. Y.-T. Leung and M. L. Merrill, A Note on Preemptive Scheduling of Periodic, Real-Time Tasks,Information Processing Letters, Vol. 11, No. 3, 1980, pp. 115–118.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    J. Y.-T. Leung and J. Whitehead, On the Complexity of Fixed-Priority Scheduling of Periodic, Real-Time Tasks,Performance Evaluation, Vol. 2, 1982, pp. 237–250.zbMATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    C. L. Liu and J. W. Layland, Scheduling Algorithms for Multiprogramming in a Hard Real-Time Environment,Journal of the ACM, Vol. 20, No. 1, 1973, pp. 46–61.zbMATHCrossRefMathSciNetGoogle Scholar
  8. [8]
    O. Serlin, Scheduling of Time Critical Processes,Proceedings of the Spring Joint Computer Conference, 1972, pp. 925–932.Google Scholar

Copyright information

© Springer-Verlag New York Inc 1989

Authors and Affiliations

  • Joseph Y. -T. Leung
    • 1
  1. 1.Computer Science ProgramUniversity of Texas at DallasRichardsonUSA

Personalised recommendations