ACM SIGAda Ada Letters
The control of priority inversion in Ada
ACM SIGAda Ada Letters
System level concurrency control for distributed database systems
ACM Transactions on Database Systems (TODS)
Some Deadlock Properties of Computer Systems
ACM Computing Surveys (CSUR)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Priority Inheritance and Ceilings for Distributed Mutual Exclusion
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Basic Program Structures for Avoiding Priority Inversions
ISORC '03 Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
ACM SIGOPS Operating Systems Review
Priority inversion in multi processor systems due to protected actions
ACM SIGAda Ada Letters
The implementation of the Priority Ceiling Protocol in Ada-2005
ACM SIGAda Ada Letters
An anomaly prevention approach for real-time task scheduling
Journal of Systems and Software
Defining defects, errors, and service degradations
ACM SIGSOFT Software Engineering Notes
Avoiding unbounded priority inversion in barrier protocols using gang priority management
Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems
| Hi-index | 0.00 |
Priority inversion occurs when the execution of a task is unnecessarily delayed by the dispatch of a lower priority task. This anomaly can result in failure if it causes the delay of hard real-time tasks. Priority inheritance protocols have been developed to limit priority inversions during competition over shared resources. Such methods are designed for individually identifiable resource units. Other approaches are indicated when shared resources contain interchangeable resource units. Current practices with resource deadlock, a scheduling anomaly that has many characteristics in common with priority inversion, provide insight into the control of priority inversion with these fungible resources.