Affiliation:
1. Fairleigh Dickinson University, Teaneck, NJ
Abstract
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.
Publisher
Association for Computing Machinery (ACM)
Reference18 articles.
1. An anomaly prevention approach for real-time task scheduling
2. The implementation of the Priority Ceiling Protocol in Ada-2005
3. Priority inversion in Ada
4. Graham R. L. 1976. Bounds on the performance of scheduling algorithms Computer and Job-Shop Scheduling Theory E.G. Coffman ed. John Wiley and Sons NY 165--227. Graham R. L. 1976. Bounds on the performance of scheduling algorithms Computer and Job-Shop Scheduling Theory E.G. Coffman ed. John Wiley and Sons NY 165--227.
5. Some Deadlock Properties of Computer Systems
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Priority inversion in DRTDBS;Proceedings of the ACM India Joint International Conference on Data Science and Management of Data;2018-01-11
2. A One Phase Priority Inheritance Commit Protocol;Distributed Computing and Internet Technology;2017-11-29