Current Results on EDZL Scheduling for Multiprocessor Real-Time Systems

Authors:
Hsin-Wen Wei;Yi-Hsiung Chao;Shun-Shii Lin;Kwei-Jay Lin;Wei-Kuan Shih
Affiliations:
National Tsing Hua University, Hsinchu, Taiwan;National Taiwan Normal University, Taipei, Taiwan;National Taiwan Normal University, Taipei, Taiwan;University of California, Irvine, CA;National Tsing Hua University, Hsinchu, Taiwan
Venue:
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2007

Citing 0
Cited 3

Portioned EDF-based scheduling on multiprocessors

EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Global EDF-based scheduling with laxity-driven priority promotion

Journal of Systems Architecture: the EUROMICRO Journal
A scheduling algorithm to reduce the static energy consumption of multiprocessor real-time systems

Proceedings of the 21st International conference on Real-Time Networks and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.