A precise schedulability test algorithm for scheduling periodic tasks in real-time systems

Authors:
Wan-Chen Lu;Jen-Wei Hsieh;Wei-Kuan Shih
Affiliations:
National Tsing Hua University, Taiwan, R.O.C.;National Taiwan University, Taiwan, R.O.C.;National Tsing Hua University, Taiwan, R.O.C.
Venue:
Proceedings of the 2006 ACM symposium on Applied computing
Year:
2006

Citing 4
Cited 0

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

Journal of the ACM (JACM)
Efficient On-Line Schedulability Tests for Priority Driven Real-Time Systems

RTAS '00 Proceedings of the Sixth IEEE Real Time Technology and Applications Symposium (RTAS 2000)
The Space of Rate Monotonic Schedulability

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
A Hyperbolic Bound for the Rate Monotonic Algorithm

ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rate monotonic analysis (RMA) has been shown to be effective in the schedulability analysis of various types of system. This paper focuses on reducing the run time of each RMA-tested system. Based on a new concept of tasks, denoted by the lift-utilization tasks, we propose a novel method to reduce the number of iterative calculations in the derivation of the worst-case response time of each task in its RMA test. The capability of the proposed method was evaluated and compared to related work, which revealed that our method produced savings of 26-33% in the number of RMA iterations.