Rate monotonic schedulability tests using period-dependent conditions

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

*Corresponding author for this work

Research output: Contribution to journalJournal Article peer-review

10 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 second 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
Pages (from-to)123-138
Number of pages16
JournalReal-Time Systems
Volume37
Issue number2
DOIs
StatePublished - 11 2007
Externally publishedYes

Keywords

  • Periodic scheduling
  • Rate monotonic analysis
  • Real-time systems
  • Schedulability test

Fingerprint

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

Cite this