Current results on EDZL scheduling for multiprocessor real-time systems

Hsin Wen Wei*, Yi Hsiung Chao, Shun Shii Lin, Kwei Jay Lin, Wei Kuan Shih

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contribution

18 Citations (Scopus)

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+|u max-1/2| for two-processor systems, where u max 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.

Original languageEnglish
Title of host publicationProceedings - 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2007
Pages120-127
Number of pages8
DOIs
Publication statusPublished - 2007
Event4296821 - Daegu, Korea, Republic of
Duration: 2007 Aug 212007 Aug 24

Publication series

NameProceedings - 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2007

Other

Other4296821
Country/TerritoryKorea, Republic of
CityDaegu
Period2007/08/212007/08/24

ASJC Scopus subject areas

  • Computer Science Applications
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Current results on EDZL scheduling for multiprocessor real-time systems'. Together they form a unique fingerprint.

Cite this