|
Published Articles >> Table of Contents >> Abstract
19th Euromicro Conference on Real-Time Systems (ECRTS'07)
pp. 9-18
EDZL Scheduling Analysis
1 Cirinei, Scuola Superiore Sant'Anna, Italy
1 Baker, Florida State University, USA
Full Article Text:
  
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ECRTS.2007.14
Send link to a friend
| Abstract |
|
A schedulability test is derived for the global Earliest Deadline Zero Laxity (EDZL) scheduling algorithm on a platform with multiple identical processors. The test is sufficient, but not necessary, to guarantee that a system of independent sporadic tasks with arbitrary deadlines will be successfully scheduled, with no missed deadlines, by the multiprocessor EDZL algorithm. Global EDZL is known to be at least as effective as global Earliest-Deadline-First (EDF) in scheduling task sets to meet deadlines. It is shown, by testing on large numbers of pseudo-randomly generated task sets, that the combination of EDZL and the new schedulability test is able to guarantee that far more task sets meet deadlines than the combination of EDF and known EDF schedulability tests.
|
 Additional Information
|
Citation:
1 Cirinei, 1 Baker,
"EDZL Scheduling Analysis,"
ecrts,
pp. 9-18,
19th Euromicro Conference on Real-Time Systems (ECRTS'07),
2007
|
|
