Predictability of Earliest Deadline Zero Laxity Algorithm for Multiprocessor Real-Time Systems

Authors:
Xuefeng Piao;Sangchul Han;Heeheon Kim;Minkyu Park;Yookun Cho;Seongje Cho
Affiliations:
Seoul National University, Korea;Seoul National University, Korea;Seoul National University, Korea;Seoul National University, Korea;Seoul National University, Korea;Dankook University, Korea
Venue:
ISORC '06 Proceedings of the Ninth IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing
Year:
2006

Citing 0
Cited 8

Portioned EDF-based scheduling on multiprocessors

EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
EDZL scheduling analysis

Real-Time Systems
Generalized tardiness bounds for global multiprocessor scheduling

Real-Time Systems
Brute-force determination of multiprocessor schedulability for sets of sporadic hard-deadline tasks

OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Global EDF-based scheduling with laxity-driven priority promotion

Journal of Systems Architecture: the EUROMICRO Journal
A survey of hard real-time scheduling for multiprocessor systems

ACM Computing Surveys (CSUR)
Predictability of least laxity first scheduling algorithm on multiprocessor real-time systems

EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
FPSL, FPCL and FPZL schedulability analysis

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Validation methods for hard real-time jobs are usually performed based on the maximum execution time. The actual execution time of jobs are assumed to be known only when the jobs arrive or not known until they finish. A predictable algorithm must guarantee that it can generate a schedule for any set of jobs such that the finish time for the actual execution time is no later than the finish time for the maximum execution time. It is known that any job-level fixed priority algorithm (such as Earliest Deadline First) is predictable. However, job-level dynamic priority algorithms (such as Least Laxity First) may or may not. In this paper, we investigate the predictability of a job-level dynamic priority algorithm EDZL (Earliest Deadline Zero Laxity). We show that EDZL is predictable on the domain of integers regardless of the knowledge of the actual execution times. Based on this result, furthermore, we also show that EDZL can successfully schedule any periodic task set if the total utilization is not greater than (m + 1)/2, where m is the number of processors.