Generalized rate monotonic schedulability bounds using relative period ratios

Authors:
Hsin-Wen Wei;Kwei-Jay Lin;Wan-Chen Lu;Wei-Kuan Shih
Affiliations:
Department of Computer Science, National TsingHua University, Hsinchu, Taiwan;Department of Electrical Engineering and Computer Science, University of California, Irvine, USA;Department of Computer Science, National TsingHua University, Hsinchu, Taiwan;Department of Computer Science, National TsingHua University, Hsinchu, Taiwan
Venue:
Information Processing Letters
Year:
2008

Citing 5
Cited 2

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

Journal of the ACM (JACM)
An Improved Rate-Monotonic Admission Control and Its Applications

IEEE Transactions on Computers
A Hyperbolic Bound for the Rate Monotonic Algorithm

ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Efficient Online Schedulability Tests for Real-Time Systems

IEEE Transactions on Software Engineering
Rate Monotonic Schedulability Conditions Using Relative Period Ratios

RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications

Comments on "Generalized rate monotonic schedulability bounds using relative period ratios"

Information Processing Letters
Rhythmic Tasks: A New Task Model with Continually Varying Periods for Cyber-Physical Systems

ICCPS '12 Proceedings of the 2012 IEEE/ACM Third International Conference on Cyber-Physical Systems

Quantified Score

Hi-index	0.89

Visualization

Abstract

One of the most well-studied scheduling algorithms for real-time systems is the Rate Monotonic (RM) scheduling for periodic tasks. In this paper we derive a generalized RM schedulability bound by considering relative period ratios among tasks in a system. We show that schedulability bounds published earlier are special cases of our generalized bound. Our new bound may provide a higher value than earlier results.