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

*此作品的通信作者

研究成果: 書貢獻/報告類型會議論文篇章

18 引文 斯高帕斯(Scopus)

摘要

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.

原文英語
主出版物標題Proceedings - 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2007
頁面120-127
頁數8
DOIs
出版狀態已發佈 - 2007
事件4296821 - Daegu, 大韓民國
持續時間: 2007 8月 212007 8月 24

出版系列

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

其他

其他4296821
國家/地區大韓民國
城市Daegu
期間2007/08/212007/08/24

ASJC Scopus subject areas

  • 電腦科學應用
  • 控制與系統工程
  • 電氣與電子工程

指紋

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

引用此