Global EDF-based scheduling with efficient priority promotion

Shinpei Kato, Nobuyuki Yamasaki

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

17 Citations (Scopus)

Abstract

This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for the efficient scheduling of sporadic real-time tasks on multiprocessors systems. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm in that the priority of a job reaching certain laxity is imperiously promoted to the top, but it differs in that the occurrence of priority promotion is confined to at the release time or the completion time of a job. This modification enables EDCL to bound the number of scheduler invocations and to relax the implementation complexity of scheduler, while the schedulability is still competitive with EDZL. The schedulability test of EDCL is designed through theoretical analysis. In addition, an error in the traditional schedulability test of EDZL is corrected. Simulation studies demonstrate the effectiveness of EDCL in terms of guaranteed schedulability and exhaustive schedulability by comparing with traditional efficient scheduling algorithms.

Original languageEnglish
Title of host publicationProceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008
Pages197-206
Number of pages10
DOIs
Publication statusPublished - 2008
Event14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008 - Kaohsiung, Taiwan, Province of China
Duration: 2008 Aug 252008 Aug 27

Other

Other14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008
CountryTaiwan, Province of China
CityKaohsiung
Period08/8/2508/8/27

Fingerprint

Scheduling
Scheduling algorithms
Derivatives

ASJC Scopus subject areas

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

Cite this

Kato, S., & Yamasaki, N. (2008). Global EDF-based scheduling with efficient priority promotion. In Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008 (pp. 197-206). [4617288] https://doi.org/10.1109/RTCSA.2008.11

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

Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008. 2008. p. 197-206 4617288.

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

Kato, S & Yamasaki, N 2008, Global EDF-based scheduling with efficient priority promotion. in Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008., 4617288, pp. 197-206, 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008, Kaohsiung, Taiwan, Province of China, 08/8/25. https://doi.org/10.1109/RTCSA.2008.11
Kato S, Yamasaki N. Global EDF-based scheduling with efficient priority promotion. In Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008. 2008. p. 197-206. 4617288 https://doi.org/10.1109/RTCSA.2008.11
Kato, Shinpei ; Yamasaki, Nobuyuki. / Global EDF-based scheduling with efficient priority promotion. Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008. 2008. pp. 197-206
@inproceedings{01788c97ba6a4989b513502aa6c8aa66,
title = "Global EDF-based scheduling with efficient priority promotion",
abstract = "This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for the efficient scheduling of sporadic real-time tasks on multiprocessors systems. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm in that the priority of a job reaching certain laxity is imperiously promoted to the top, but it differs in that the occurrence of priority promotion is confined to at the release time or the completion time of a job. This modification enables EDCL to bound the number of scheduler invocations and to relax the implementation complexity of scheduler, while the schedulability is still competitive with EDZL. The schedulability test of EDCL is designed through theoretical analysis. In addition, an error in the traditional schedulability test of EDZL is corrected. Simulation studies demonstrate the effectiveness of EDCL in terms of guaranteed schedulability and exhaustive schedulability by comparing with traditional efficient scheduling algorithms.",
author = "Shinpei Kato and Nobuyuki Yamasaki",
year = "2008",
doi = "10.1109/RTCSA.2008.11",
language = "English",
isbn = "9780769533490",
pages = "197--206",
booktitle = "Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008",

}

TY - GEN

T1 - Global EDF-based scheduling with efficient priority promotion

AU - Kato, Shinpei

AU - Yamasaki, Nobuyuki

PY - 2008

Y1 - 2008

N2 - This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for the efficient scheduling of sporadic real-time tasks on multiprocessors systems. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm in that the priority of a job reaching certain laxity is imperiously promoted to the top, but it differs in that the occurrence of priority promotion is confined to at the release time or the completion time of a job. This modification enables EDCL to bound the number of scheduler invocations and to relax the implementation complexity of scheduler, while the schedulability is still competitive with EDZL. The schedulability test of EDCL is designed through theoretical analysis. In addition, an error in the traditional schedulability test of EDZL is corrected. Simulation studies demonstrate the effectiveness of EDCL in terms of guaranteed schedulability and exhaustive schedulability by comparing with traditional efficient scheduling algorithms.

AB - This paper presents an algorithm, called Earliest Deadline Critical Laxity (EDCL), for the efficient scheduling of sporadic real-time tasks on multiprocessors systems. EDCL is a derivative of the Earliest Deadline Zero Laxity (EDZL) algorithm in that the priority of a job reaching certain laxity is imperiously promoted to the top, but it differs in that the occurrence of priority promotion is confined to at the release time or the completion time of a job. This modification enables EDCL to bound the number of scheduler invocations and to relax the implementation complexity of scheduler, while the schedulability is still competitive with EDZL. The schedulability test of EDCL is designed through theoretical analysis. In addition, an error in the traditional schedulability test of EDZL is corrected. Simulation studies demonstrate the effectiveness of EDCL in terms of guaranteed schedulability and exhaustive schedulability by comparing with traditional efficient scheduling algorithms.

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

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

U2 - 10.1109/RTCSA.2008.11

DO - 10.1109/RTCSA.2008.11

M3 - Conference contribution

SN - 9780769533490

SP - 197

EP - 206

BT - Proceedings - 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2008

ER -