Basic Program Structures for Avoiding Priority Inversions

Authors:
K. H. (Kane) Kim
Affiliations:
-
Venue:
ISORC '03 Proceedings of the Sixth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Year:
2003

Citing 0
Cited 4

Facilitating Distributed Time-Triggered Simulation of Embedded Systems and Environments

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 10 - Volume 11
Guest Editorial: Introduction to the Special Issue

Real-Time Systems
A middleware model supporting time-triggered message-triggered objects for standard Linux systems

Real-Time Systems
Priority inversion with fungible resources

ACM SIGAda Ada Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Structuring real-time concurrent programs in the form of groups of fixed-priority processes is an old art which is appropriate for only a small fraction of modern real-time distributed computing application systems. However, it is still practiced on the basis of an insufficient technical foundation. One of the basic issues in using the fixed-priority process structuring approach isto avoid the priority inversion phenomenon. It is argued that priority inversions are essentially due to the inappropriate approach used for structuring programs including the specification of the policy for allocating resources. Several basic program structuring techniques which are effective means of avoiding priority inversions are presented.