Global EDF-based scheduling with laxity-driven priority promotion

Shinpei Kato, Nobuyuki Yamasaki

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based on the well-known Global Earliest Deadline First (G-EDF) algorithm, as long as its laxity - the amount of time from the earliest possible time of job completion to the deadline of job - is above a certain value. The priority is however promoted to the highest level once the laxity falls below this certain value in order to meet the deadline. Priority promotions are aligned with arrivals and completions of jobs under EDCL to avoid additional scheduler invocations, while EDZL can promote priorities arbitrarily. As compared with EDZL, EDCL reduces runtime overhead and implementation cost, but still strictly dominates G-EDF in schedulability. Schedulability tests for EDCL are derived through theoretical analysis, and sustainability properties are also considered. Our simulation results demonstrate that EDCL is competitive to EDZL in schedulability with a smaller number of scheduler invocations, and it also outperforms traditional EDF-based algorithms.

Original languageEnglish
Pages (from-to)498-517
Number of pages20
JournalJournal of Systems Architecture
Volume57
Issue number5
DOIs
Publication statusPublished - 2011 May

Fingerprint

Scheduling
Sustainable development
Derivatives
Costs

Keywords

  • Earliest Deadline First
  • Multiprocessor scheduling
  • Real-time systems
  • Schedulability analysis
  • Sustainability analysis

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

Global EDF-based scheduling with laxity-driven priority promotion. / Kato, Shinpei; Yamasaki, Nobuyuki.

In: Journal of Systems Architecture, Vol. 57, No. 5, 05.2011, p. 498-517.

Research output: Contribution to journalArticle

@article{96bfe704a5624f368fc70546ab1ba555,
title = "Global EDF-based scheduling with laxity-driven priority promotion",
abstract = "This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based on the well-known Global Earliest Deadline First (G-EDF) algorithm, as long as its laxity - the amount of time from the earliest possible time of job completion to the deadline of job - is above a certain value. The priority is however promoted to the highest level once the laxity falls below this certain value in order to meet the deadline. Priority promotions are aligned with arrivals and completions of jobs under EDCL to avoid additional scheduler invocations, while EDZL can promote priorities arbitrarily. As compared with EDZL, EDCL reduces runtime overhead and implementation cost, but still strictly dominates G-EDF in schedulability. Schedulability tests for EDCL are derived through theoretical analysis, and sustainability properties are also considered. Our simulation results demonstrate that EDCL is competitive to EDZL in schedulability with a smaller number of scheduler invocations, and it also outperforms traditional EDF-based algorithms.",
keywords = "Earliest Deadline First, Multiprocessor scheduling, Real-time systems, Schedulability analysis, Sustainability analysis",
author = "Shinpei Kato and Nobuyuki Yamasaki",
year = "2011",
month = "5",
doi = "10.1016/j.sysarc.2011.01.002",
language = "English",
volume = "57",
pages = "498--517",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "5",

}

TY - JOUR

T1 - Global EDF-based scheduling with laxity-driven priority promotion

AU - Kato, Shinpei

AU - Yamasaki, Nobuyuki

PY - 2011/5

Y1 - 2011/5

N2 - This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based on the well-known Global Earliest Deadline First (G-EDF) algorithm, as long as its laxity - the amount of time from the earliest possible time of job completion to the deadline of job - is above a certain value. The priority is however promoted to the highest level once the laxity falls below this certain value in order to meet the deadline. Priority promotions are aligned with arrivals and completions of jobs under EDCL to avoid additional scheduler invocations, while EDZL can promote priorities arbitrarily. As compared with EDZL, EDCL reduces runtime overhead and implementation cost, but still strictly dominates G-EDF in schedulability. Schedulability tests for EDCL are derived through theoretical analysis, and sustainability properties are also considered. Our simulation results demonstrate that EDCL is competitive to EDZL in schedulability with a smaller number of scheduler invocations, and it also outperforms traditional EDF-based algorithms.

AB - This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for scheduling sporadic task systems on multiprocessors. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm. Each job is assigned a priority based on the well-known Global Earliest Deadline First (G-EDF) algorithm, as long as its laxity - the amount of time from the earliest possible time of job completion to the deadline of job - is above a certain value. The priority is however promoted to the highest level once the laxity falls below this certain value in order to meet the deadline. Priority promotions are aligned with arrivals and completions of jobs under EDCL to avoid additional scheduler invocations, while EDZL can promote priorities arbitrarily. As compared with EDZL, EDCL reduces runtime overhead and implementation cost, but still strictly dominates G-EDF in schedulability. Schedulability tests for EDCL are derived through theoretical analysis, and sustainability properties are also considered. Our simulation results demonstrate that EDCL is competitive to EDZL in schedulability with a smaller number of scheduler invocations, and it also outperforms traditional EDF-based algorithms.

KW - Earliest Deadline First

KW - Multiprocessor scheduling

KW - Real-time systems

KW - Schedulability analysis

KW - Sustainability analysis

UR - http://www.scopus.com/inward/record.url?scp=79955592284&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79955592284&partnerID=8YFLogxK

U2 - 10.1016/j.sysarc.2011.01.002

DO - 10.1016/j.sysarc.2011.01.002

M3 - Article

VL - 57

SP - 498

EP - 517

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 5

ER -