Abstract
The scheduling of systems of periodic tasks upon multiprocessor platforms is considered. Utilization-based conditions are derived for determining whether a periodic task system meets all deadlines when scheduled using the earliest deadline first scheduling algorithm (EDF) upon a given multiprocessor platform. A new priority-driven algorithm is proposed for scheduling periodic task systems upon multiprocessor platforms: this algorithm is shown to successfully schedule some task systems for which EDF may fail to meet all deadlines.
Similar content being viewed by others
References
Baruah, S., Cohen, N., Plaxton, G., and Varvel, D. 1996. Proportionate progress: a notion of fairness in resource allocation. Algorithmica 15(6): 600–625.
Burchard, A., Liebeherr, J., Oh, Y., and Son, S. H. 1995. Assigning real-time tasks to homogeneous multiprocessor systems. IEEE Transactions on Computers 44(12): 1429–1442.
Dertouzos, M. 1974. Control robotics: The procedural control of physical processors. In Proceedings of the IFIP Congres, pp. 807–813.
Funk, S., Goossens, J., and Baruah, S. 2001. On-line scheduling on uniform multiprocessors. In Proceedings of the IEEE Real-Time Systems Symposium. IEEE Computer Society Press.
Ha, R. 1995. Validating Timing Constraints in Multiprocessor and Distributed Systems. Ph.D. thesis, Department of Computer Science, University of Illinois at Urbana-Champaign. Available as Technical Report No. UIUCDCS-R-95–1907.
Ha, R., and Liu, J. W. S. October 1993. Validating timing constraints in multiprocessor and distributed real-time systems. Technical Report UIUCDCS-R-93-1833, Department of Computer Science, University of Illinois at Urbana-Champaign.
Ha, R., and Liu, J. W. S. 1994. Validating timing constraints in multiprocessor and distributed real-time systems. In Proceedings of the 14th IEEE International Conference on Distributed Computing Systems. Los Alamitos: IEEE Computer Society Press.
Kalyanasundaram, B., and Pruhs, K. 1995. Speed is as powerful as clairvoyance. In 36th Annual Symposium on Foundations of Computer Scinces (FOCS'95). Los Alamitos; IEEE Computer Society Press, pp. 214–223.
Leung, J. 1989. A new algorithm for scheduling periodic real-time tasks. Algorithmica 4: 209–219.
Liu, C., and Layland, J. 1969. Scheduling algorithms for multiprocessors in a hard real-time environment. JPL Space Programs Summary 37-60 II: 28–31.
Mok, A. 1998. Task management techniques for enforcing ED scheduling on a periodic task set. In Proceedings of the 5th IEEE Workshop on Real-Time Software and Operating Systems. Washington DC, pp. 42–46.
Phillips, C. A., Stein, C., Torng, E., and Wein, J. 1997. Optimal time-critical scheduling via resource augmentation. In Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing. El Paso, Texas, pp. 140–149.
Ripoll, I., Crespo, A., and Mok, A. K. 1996. Improvement in feasibility testing for real-time tasks. Real-Time Systems: The International Journal of Time-Critical Computing 11: 19–39.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Goossens, J., Funk, S. & Baruah, S. Priority-Driven Scheduling of Periodic Task Systems on Multiprocessors. Real-Time Systems 25, 187–205 (2003). https://doi.org/10.1023/A:1025120124771
Issue Date:
DOI: https://doi.org/10.1023/A:1025120124771