Addresses the problem of scheduling a restricted form of Ada tasks so as to guarantee satisfaction of timing constraints. Specifically, the use of deterministic scheduling for periodic tasks communicating through rendezvous is studied. This extends the work of A.K. Mok (1984) scheduling deterministic rendezvous to a class of nondeterministic rendezvous constructs. A state-space approach is used to generate schedules consistent with task systems written in an Ada subset. An algorithm for searching for valid deterministic schedules among the possible schedules is presented, along with a description of an experimental implementation. The results of scheduling some simple task systems with this implementation are included.
展开▼
