Priority inheritance protocols: an approach to real-time synchronization
- 1 January 1990
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 39 (9) , 1175-1185
- https://doi.org/10.1109/12.57058
Abstract
An investigation is conducted of two protocols belonging to the priority inheritance protocols class; the two are called the basic priority inheritance protocol and the priority ceiling protocol. Both protocols solve the uncontrolled priority inversion problem. The priority ceiling protocol solves this uncontrolled priority inversion problem particularly well; it reduces the worst-case task-blocking time to at most the duration of execution of a single critical section of a lower-priority task. This protocol also prevents the formation of deadlocks. Sufficient conditions under which a set of periodic tasks using this protocol may be scheduled is derivedKeywords
This publication has 9 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasksPublished by Association for Computing Machinery (ACM) ,1988
- Preemptive Scheduling Under Time and Resource ConstraintsIEEE Transactions on Computers, 1987
- Performance of real-time bus scheduling algorithmsACM SIGMETRICS Performance Evaluation Review, 1986
- Dynamic Task Scheduling in Hard Real-Time Distributed systemsIEEE Software, 1984
- A note on preemptive scheduling of periodic, real-time tasksInformation Processing Letters, 1980
- Experience with processes and monitors in MesaCommunications of the ACM, 1980
- Guaranteed Response Times in a Hard-Real-Time EnvironmentIEEE Transactions on Software Engineering, 1980
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973