Schedulability issues for EDZL scheduling on real-time multiprocessor systems

Authors:
Yi-Hsiung Chao;Shun-Shii Lin;Kwei-Jay Lin
Affiliations:
Department of Computer Science and Information Engineering, National Taiwan Normal University, Taiwan, ROC;Department of Computer Science and Information Engineering, National Taiwan Normal University, Taiwan, ROC;Department of Electrical Engineering and Computer Science, University of California, Irvine, USA
Venue:
Information Processing Letters
Year:
2008

Citing 5
Cited 3

Multiprocessor Online Scheduling of Hard-Real-Time Tasks

IEEE Transactions on Software Engineering
Deadline-based scheduling of periodic task systems on multiprocessors

Information Processing Letters
Designing Multimedia Applications on Real-Time Systems with SMP Architecture

MSE '02 Proceedings of the Fourth IEEE International Symposium on Multimedia Software Engineering
Comparison of Deadline-Based Scheduling Algorithms for Periodic Real-Time Tasks on Multiprocessor*This work is supported in part by Brain Korea 21 project and in part by ICT.

IEICE - Transactions on Information and Systems
Utilization bound revisited

IEEE Transactions on Computers

A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Real-Time Systems
FPSL, FPCL and FPZL schedulability analysis

Real-Time Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

EDZL (Earliest Deadline first until Zero Laxity) is an efficient and practical scheduling algorithm on multiprocessor systems. It has a comparable number of context switch to EDF (Earliest Deadline First) and its schedulable utilization seems to be higher than that of EDF. Previously, there was a conjecture that the utilization bound of EDZL is 3m/4=0.75m for m processors. In this paper, we disprove this conjecture and show that the utilization bound of EDZL is no greater than m(1-1/e)~0.6321m, where e~2.718 is the Euler's number.