Real-Time Scheduling and Ada

[taco!pesun.ncsu.edu!anf@gatech.edu (Andre N. Fredette)]

The primary real-time scheduling algorithms for uni-processors seem to
be rate-monotonic, earliest deadline, and least slack.

The general Ada runtime system seems to be fairly compatible with
rate-monotonic scheduling.  Furthermore, with the implementation of some
of the features outlined in the Catalogue of Interface Features and Options
for the Ada Runtime Environment (CIFO) and Ada 9x documents, such as
priority inheritance and different queuing disciplines, Ada and
rate-monotonic scheduling should be very compatible.

However, Ada runtime systems do not seem to support earliest deadline or
least slack scheduling at all.  As far as I can tell, there is no explicit 
support for these disciplines in Ada 9x either -- although their
implementation in a particular compiler is not prohibited.

I'd be interested in any comments on any of these ideas/statements.

Andre N. Fredette
anf@pesun.ncsu.edu