Sources of unbounded priority inversions in real-time systems and a comparative study of possible solutions
- 1 April 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 26 (2) , 110-120
- https://doi.org/10.1145/142111.142126
Abstract
In the design of real-time systems, tasks are often assigned priorities. Preemptive priority driven schedulers are used to schedule tasks to meet the timing requirements. Priority inversion is the term used to describe the situation when a higher priority task's execution is delayed by lower priority tasks. Priority inversion can occur when there is contention for resources among tasks of different priorities. The duration of priority inversion could be long enough to cause tasks to miss their deadlines. Priority inversion cannot be completely eliminated. However, it is important to identify sources of priority inversion and minimize the duration of priority inversion. IN the paper we present a comprehensive review of the problem of and solutions to unbounded priority inversion.Keywords
This publication has 6 references indexed in Scilit:
- Real-time synchronization protocols for multiprocessorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Real-time scheduling theory and AdaComputer, 1990
- Priority inheritance protocols: an approach to real-time synchronizationIEEE Transactions on Computers, 1990
- Real-time scheduling support in Futurebus+Published by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- The priority ceiling protocol: A method for minimizing the blocking of high priority Ada tasksPublished by Association for Computing Machinery (ACM) ,1988
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973