Schedulability issues for EDZL scheduling on real-time multiprocessor systems

Yi Hsiung Chao, Shun-Shii Lin, Kwei Jay Lin

研究成果: 雜誌貢獻文章同行評審

19 引文 斯高帕斯(Scopus)

摘要

EDZL (Earliest Deadline first until Zero Laxity) is an efficient and practical scheduling algorithm on multiprocessor systems. It has a comparable number of context switch to EDF (Earliest Deadline First) and its schedulable utilization seems to be higher than that of EDF. Previously, there was a conjecture that the utilization bound of EDZL is 3 m / 4 = 0.75 m for m processors. In this paper, we disprove this conjecture and show that the utilization bound of EDZL is no greater than m (1 - 1 / e) ≈ 0.6321 m, where e ≈ 2.718 is the Euler's number.

原文英語
頁(從 - 到)158-164
頁數7
期刊Information Processing Letters
107
發行號5
DOIs
出版狀態已發佈 - 2008 八月 16

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

指紋 深入研究「Schedulability issues for EDZL scheduling on real-time multiprocessor systems」主題。共同形成了獨特的指紋。

引用此