Rate Monotonic Schedulability Conditions Using Relative Period Ratios

Authors:
Wan-Chen Lu;Hsin-Wen Wei;Kwei-Jay Lin
Affiliations:
National Tsing Hua University, Taiwan;National Tsing Hua University, Taiwan;University of California, Irvine, USA
Venue:
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2006

Citing 0
Cited 3

Generalized rate monotonic schedulability bounds using relative period ratios

Information Processing Letters
Non-preemptive Fixed Priority Scheduling of Hard Real-Time Periodic Tasks

ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
Comments on "Generalized rate monotonic schedulability bounds using relative period ratios"

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

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.