loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007)
Current Results on EDZL Scheduling for Multiprocessor Real-Time Systems
Daegu, Korea
August 21-August 24
ISBN: 0-7695-2975-5
Hsin-Wen Wei, National Tsing Hua University, Hsinchu, Taiwan
Yi-Hsiung Chao, National Taiwan Normal University, Taipei, Taiwan
Shun-Shii Lin, National Taiwan Normal University, Taipei, Taiwan
Kwei-Jay Lin, University of California, Irvine, CA
Wei-Kuan Shih, National Tsing Hua University, Hsinchu, Taiwan
Many optimal uniprocessor schedulers, such as Earliest Deadline First (EDF) and Rate Monotonic (RM), do not have a good schedulability bound on multiprocessor systems. In this paper, we study an on-line algorithm Earliest Deadline First until Zero laxity (EDZL) for multiprocessor systems. A set of tasks scheduled by EDZL is scheduled using EDF until a job experiences a zero laxity. To avoid the job from missing its deadline, the priority of the job is immediately promoted to the highest priority. We derive the schedulability bound of 3/2+|umax?1/2| for two-processor systems, where umax is the maximum utilization of an individual task in the given task set. We also discuss the best known upper bound and lower bound on EDZL schedulability conditions.
Citation:
Hsin-Wen Wei, Yi-Hsiung Chao, Shun-Shii Lin, Kwei-Jay Lin, Wei-Kuan Shih, "Current Results on EDZL Scheduling for Multiprocessor Real-Time Systems," rtcsa, pp.120-130, 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.