Implementing Priority Inheritance Algorithms in an Ada Runtime System
Abstract
This paper presents a high-level design-in the form of necessary data structures, mechanisms, and algorithms-for implementing the basic priority inheritance and priority ceiling protocols in an Ada runtime system. Both of these protocols solve the unbounded priority inversion problem, where a high- priority task can be forced to wait for a lower priority task for an arbitrary duration time. The protocols and their implementation also address the issues of non-deterministic selection of open alternatives and FIFO entry call queues. These protocols allow the timing analysis of a given set of Ada tasks in order to guarantee their deadlines in real-time systems. Importantly, it is possible to implement the protocols within the current semantics of the Ada language given the interpretations of Ada rules described by Goodenough and Sha in the Software Engineering Institute Technical Report 33 (1988). Strategies and possible alternatives are discussed for implementing these protocols in an Ada runtime system targeted to a uniprocessor execution environment.
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1989
- Accession Number
- ADA209607
Entities
People
- Mark W. Borger
- Ragunathan Rajkumar
Organizations
- Carnegie Mellon University