Rate monotonic schedulability conditions using relative period ratios

Wan Chen Lu*, Hsin Wen Wei, Kwei Jay Lin

*此作品的通信作者

研究成果: 圖書/報告稿件的類型會議稿件同行評審

13 引文 斯高帕斯(Scopus)

摘要

Feasibility and schedulability problems have received considerable attention from the real-time systems research community in recent decades. Since the publication of the Liu and Layland bound, many researchers have tried to improve the schedulability bound of the RM scheduling. The LL bound does not make any assumption on the relationship between any of the task periods. In this paper we consider the relative period ratios in a system. By reducing the difference between the smallest and the largest virtual period values in a system, we can show that the RM schedulability bound can be improved significantly. This research has also proposed a system design methodology to improve the schedulability of real time system with a fixed system load.

原文英語
主出版物標題12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2006
發行者IEEE Computer Society
頁面3-9
頁數7
ISBN(列印)0769526764, 9780769526768
DOIs
出版狀態已出版 - 2006
對外發佈
事件12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2006 - Sydney, 澳大利亞
持續時間: 16 08 200618 08 2006

出版系列

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

Conference

Conference12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2006
國家/地區澳大利亞
城市Sydney
期間16/08/0618/08/06

指紋

深入研究「Rate monotonic schedulability conditions using relative period ratios」主題。共同形成了獨特的指紋。

引用此