Abstract
This paper summarizes recent research results on the theory of fixed priority scheduling of hard real-time systems developed by the Advanced Real-Time Technology (ART) Project of Carnegie Mellon University. The Liu and Layland theory of rate monotonic scheduling is presented along with many generalizations including an exact characterization of task set schedulability, average case behavior and allowance for arbitrary task deadlines Recent research results including the priority ceiling protocol which provides predictable scheduling when tasks synchronize and the deferrable and sporadic server algorithms which provide fast response times for aperiodic tasks while preserving periodic task deadlines are also presented.
Sponsored in part by the Office of Naval Research under contract N00014-84-K-0734, in part by the Naval Ocean Systems Center under contract N66001-87-C-0155, and in part by the Systems Integration Division of IBM Corporation under University Agreement Y-278067
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bettati, R. and Liu, J.W.S., “Algorithms for end-to-end scheduling to meet deadlines,” Report No. UIUCDCS-R-90–1594, Department of Computer Science, University of Illinois.
Lehoczky, J.P., “Fixed priority scheduling of periodic task sets with arbitrary deadlines,” Proceedings of the 11 thIEEE Real-Time Systems Symposium,December 1990, 201–209.
Lehoczky J. P., Sha, L. and Strosnider, J. K., “Enhanced aperiodic responsiveness in hard real-time environments,” Proceedings of the 8 th IEEE Real-Time Systems Symposium,December 1987, 261–270.
Lehoczky, J.P., and Sha, L., “Performance of real-time bus scheduling algorithms,” ACM Performance Evaluation Review,14,1986.
Lehoczky, J.P., Sha, L. and Ding, Y., “The rate monotonic scheduling algorithm: exact characterization and average case behavior,” Proceedings of the 10 th IEEE Real-Time Systems Symposium, December1989, 166–171.
Leung, J. and Whitehead, J., “On the complexity of fixed-priority scheduling of periodic, real-time tasks,” Performance Evaluation, 2, 1982, 237–50
Liu, C.L. and Layland, J.W., “Scheduling algorithms for multiprogramming in a hard real-time environment,” JACM, 20, 1973, 460–61
Peng, D-T. and Shin, K.G., “A new performance measure for scheduling independent real-time tasks,” Technical Report, Real-Time Computing Laboratory, University of Michigan, 1989.
Rajkumar, R., “Task synchronization in real-time systems,” Ph. D. Dissertation, Department of Electrical and Computer Engineering, Carnegie Mellon University, 1989.
Rajkumar, R., Sha, L. and Lehoczky, J.P., “On countering the effects of cycle-stealing in a hard real-time environment,” Proceedings of the 8th IEEE Real-Time Systems Symposium, December 1987, 2–11.
Rajkumar, R., Sha, L. and Lehoczky, J.P., “Real-time synchronization for multiprocessors,” Proceedings of the 9th IEEE Real-Time Systems Symposium, December 1988, 259–269.
Sha, L., Rajkumar, R. and Lehoczky, J. P., “Priority inheritance protocols: An approach to real-time synchronization,” IEEE Transactions on Computers,Vol 39,1990, 1175–1185.
Sha, L. and Goodenough, J., “Real-time scheduling theory and Ada,” Computer, 23 No. 4, 1990, 53–62.
Sha, L., Lehoczky, J.P. and Rajkumar, R., “Solutions for some practical problems in prioritized preemptive scheduling,” Proceedings of the 7th IEEE Real-Time Systems Symposium, December 1986, 181–191.
Sha, L., Rajkumar, R., Lehoczky, J.P. and Ramamritham, K., “Mode change protocols for priority-driven preemptive scheduling,” Journal of Real-Time Systems, 1,1989, 243–264.
Shih, W. K., Liu, J. W. S. and Liu, C. L., “Scheduling periodic jobs with deferred deadlines,” Report No. UIUCDCS-R-90–1593, University of Illinois, 1990.
Sprunt, B., Lehoczky, J. P. and Sha, L., “Exploiting unused periodic time for aperiodic service using the extended priority exchange algorithm,” Proceedings of the 9 th IEEE Real-Time Systems Sym posium, December 1988, 251–258.
Sprunt, B., Sha, L. and Lehoczky, J. P., “Aperiodic task scheduling for hard real-time systems,” Journal of Real-Time Systems, 1, 1989, 27–60.
Sprunt, B., “Aperiodic task scheduling for real-time systems,” Ph. D. dissertation, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, Pa, August 1990.
Strosnider, J. K., “Highly responsive real-time token rings,” Ph. D. dissertation, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, August 1988.
Strosnider, J.K., Marchok, T. and Lehoczky, J.P., “Advanced real-time scheduling using the IEEE 802.5 token ring,” Proceedings of the 9th Real-Time Systems Symposium, December 1988.
Strosnider, J.K. and Marchok, T., “ Responsive, deterministic IEEE 802.5 token ring scheduling,” Journal of Real-Time Systems,1, 1989, 133–158.
Tokuda, H. and Mercer, C.W., “ARTS: A distributed real-time kernel,” ACM Operating Systems Review, 23(3), July 1989.
Tokuda, H. and Kotera, M., “A real-time tool set for the ARTS kernel,” Proceedings of the 9th IEEE Real-Time Systems Symposium, December 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer Science+Business Media New York
About this chapter
Cite this chapter
Lehoczky, J.P., Sha, L., Strosnider, J.K., Tokuda, H. (1991). Fixed Priority Scheduling Theory for Hard Real-Time Systems. In: van Tilborg, A.M., Koob, G.M. (eds) Foundations of Real-Time Computing: Scheduling and Resource Management. The Springer International Series in Engineering and Computer Science, vol 141. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-3956-8_1
Download citation
DOI: https://doi.org/10.1007/978-1-4615-3956-8_1
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6766-6
Online ISBN: 978-1-4615-3956-8
eBook Packages: Springer Book Archive