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

Authors:
Moonju Park
Affiliations:
Department of Computer Science and Engineering, University of Incheon, 12-1 Songdo-dong, Yeonsu-gu, Incheon 406-772, Republic of Korea
Venue:
Information Processing Letters
Year:
2011

Citing 7
Cited 0

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

Journal of the ACM (JACM)
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems

IEEE Transactions on Computers
An Improved Rate-Monotonic Admission Control and Its Applications

IEEE Transactions on Computers
Rate Monotonic Analysis: The Hyperbolic Bound

IEEE Transactions on Computers
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
Generalized rate monotonic schedulability bounds using relative period ratios

Information Processing Letters
Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard

RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium

Quantified Score

Hi-index	0.89

Visualization

Abstract

In this Letter, it is shown that the schedulability test method for task sets with the maximum period ratio larger than or equal to 2 presented in the paper [Wei et al., Generalized rate monotonic schedulability bounds using relative period ratios, Information Processing Letters 107 (5) (2008) 142-148] is not exactly correct by presenting a counter-example. Correct sufficient conditions for using period ratios in RM schedulability test when the maximum period ratio is not less than 2 are also presented.