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 wordsPeriodic Real-time tasks Multiprocessor system Schedulability co-NP-hard
- E. G. Coffman, Jr. and P. J. Denning,Operating Systems Theory, Prentice-Hall, Englewood Cliffs, NJ, 1973.Google Scholar
- 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
- O. Serlin, Scheduling of Time Critical Processes,Proceedings of the Spring Joint Computer Conference, 1972, pp. 925–932.Google Scholar