Real-Time Scheduling Theory and Ada [report]

Lui Sha, John B. Goodenough
1988 unpublished
A A 17 U mp um a Abstract: 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. CMU/SEI88-TR-33 0 .. . . .== = mnul n
more » ... lnn mu u 6 CMU/SEI-88-TR-33 11 -"0. m ",ma "= m im I l l CMU/SEI-68-TR-33 17 .. .. 0---=.=== ="=, m mmm n ~ n~m 18 CMU/SEI-88.TR-33
doi:10.21236/ada205048 fatcat:36eu7nlvwbakrgdn2nw7kzwqva