loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
19th Euromicro Conference on Real-Time Systems (ECRTS'07)
EDZL Scheduling Analysis
Pisa, Italy
July 04-July 06
ISBN: 0-7695-2914-3
Michele Cirinei, Scuola Superiore Sant'Anna, Italy
Theodore P. Baker, Florida State University, USA
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.
Citation:
Michele Cirinei, Theodore P. Baker, "EDZL Scheduling Analysis," ecrts, pp.9-18, 19th Euromicro Conference on Real-Time Systems (ECRTS'07), 2007
Usage of this product signifies your acceptance of the Terms of Use.