Abstract
The tasking model in Ada suffers from several limitations which make scheduling strategies cumbersome for many embedded systems. This paper discusses the timing needs of one class of these systems and describes a plausible response to the problems.

This publication has 0 references indexed in Scilit: