Rate monotonic scheduling re-analysed

Authors:
Qiwen Xu;Naijun Zhan
Affiliations:
Faculty of Science and Technology, University of Macau, Macau, PR China;Lab. of Computer Science, Institute of Software, Chinese Academy of Sciences & State Key Laboratory of Rail Traffic Control and Safety, Beijing Jiaotong University, Beijing, PR China
Venue:
Information Processing Letters
Year:
2010

Citing 4
Cited 0

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Liu and Layland's schedulability test revisited

Information Processing Letters
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
A Formal Proof of the Rate Monotonic Scheduler

RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this paper, we re-analyse the rate monotonic scheduler. Traditionally, the schedulability condition was obtained from the greatest lower bound of utilisation factors over all the task sets that (are schedulable and) fully utilise the processor. We argue that full utilisation is not very appropriate for this purpose. We re-establish Liu and Layland's classic schedulability theorem by finding the greatest lower bound of utilisation factors over all the unschedulable task sets instead. The merits of our approach include: Firstly, the fact that the bound is both sound and tight for schedulability follows directly from definition; Secondly, our proof is simpler technically.