Real-Time Scheduling Theory and ADA (1988)
November 1988 • Technical Report
Lui R. Sha, John B. Goodenough
This 1988 report reviews results of a priority-based scheduling theory, illustrates its applications with examples, discusses its implications for the Ada tasking model, and suggests workarounds.
Software Engineering Institute
CMU/SEI Report Number
The ADA tasking model was intended to facilitate the management of concurrency in a priority-driven scheduling environment. In this paper, we will review some important results of a priority-based scheduling theory, illustrate its applications with examples, discuss its implications for the ADA tasking model, and suggest workarounds that permit us to implement analytical scheduling algorithms within the existing framework of ADA.