Skip to main navigation Skip to search Skip to main content

Finish time predictability of earliest Deadline Zero Laxity algorithm for multiprocessor real-time systems

  • Sangchul Han*
  • , Heeheon Kim
  • , Xuefeng Piao
  • , Minkyu Park
  • , Seongje Cho
  • , Yookun Cho
  • *Corresponding author for this work
  • Seoul National University
  • Konkuk University
  • Dankook University

Research output: Contribution to journalArticlepeer-review

Abstract

This letter proves the finish time predictability of EDZL (Earliest Deadline Zero Laxity) scheduling algorithm for multiprocessor real-time systems, which is a variant of EDF. Based on the results, it also shows that EDZL can successfully schedule any periodic task set if its total utilization is not greater than (m + 1)/2, where m is the number of processors.

Original languageEnglish
Pages (from-to)2981-2984
Number of pages4
JournalIEICE Transactions on Information and Systems
VolumeE89-D
Issue number12
DOIs
StatePublished - Dec 2006
Externally publishedYes

Keywords

  • Earliest Deadline Zero Laxity
  • Embedded real-time system
  • Finish time predictability
  • Multiprocessor
  • Priority-driven scheduling

Fingerprint

Dive into the research topics of 'Finish time predictability of earliest Deadline Zero Laxity algorithm for multiprocessor real-time systems'. Together they form a unique fingerprint.

Cite this