Rate monotonic schedulability conditions using relative period ratios

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

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2006
PublisherIEEE Computer Society
Pages3-9
Number of pages7
ISBN (Print)0769526764, 9780769526768
DOIs
StatePublished - 2006
Externally publishedYes
Event12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, RTCSA 2006 - Sydney, Australia
Duration: 16 08 200618 08 2006

Publication series

NameProceedings - 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
Country/TerritoryAustralia
CitySydney
Period16/08/0618/08/06

Fingerprint

Dive into the research topics of 'Rate monotonic schedulability conditions using relative period ratios'. Together they form a unique fingerprint.

Cite this