Software Engineering Institute Carnegie Mellon

Real-Time Scheduling Theory and Ada

Sha, L.
Goodenough, J.

Technical Report
CMU/SEI-88-SR-033

PDF File
PostScript File

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.