DocumentCode :
2262501
Title :
Toward the deterministic scheduling of Ada tasks
Author :
Giering, E.W., III ; Baker, T.P.
Author_Institution :
Dept. of Comput. Sci., Florida State Univ., Tallahassee, FL, USA
fYear :
1989
fDate :
5-7 Dec 1989
Firstpage :
31
Lastpage :
40
Abstract :
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
Keywords :
Ada; scheduling; Ada tasks; deterministic scheduling; nondeterministic rendezvous constructs; state-space approach; timing constraints; Computer languages; Computer science; Delay; Logic programming; Parallel programming; Processor scheduling; Real time systems; Scheduling algorithm; State-space methods; Timing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Real Time Systems Symposium, 1989., Proceedings.
Conference_Location :
Santa Monica, CA
Print_ISBN :
0-8186-2004-8
Type :
conf
DOI :
10.1109/REAL.1989.63554
Filename :
63554
Link To Document :
بازگشت