A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Real-Time Scheduling Theory and Ada
[report]
1988
unpublished
Preserved Fulltext
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
doi:10.21236/ada205048
fatcat:36eu7nlvwbakrgdn2nw7kzwqva