Abstract
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≥.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
E. G. Coffman, Jr. and P. J. Denning,Operating Systems Theory, Prentice-Hall, Englewood Cliffs, NJ, 1973.
S. K. Dhall and C. L. Liu, On a Real-Time Scheduling Problem,Operations Research, Vol. 26, No. 1, 1978, pp. 127–140.
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.
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.
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.
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.
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.
O. Serlin, Scheduling of Time Critical Processes,Proceedings of the Spring Joint Computer Conference, 1972, pp. 925–932.
Author information
Authors and Affiliations
Additional information
Communicated by C. L. Liu.
Rights and permissions
About this article
Cite this article
Leung, J.Y.T. A new algorithm for scheduling periodic, real-time tasks. Algorithmica 4, 209–219 (1989). https://doi.org/10.1007/BF01553887
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01553887