A feasibility decision algorithm for rate monotonic scheduling of periodic real-time tasks

Authors:
Y. Manabe;S. Aoyagi
Affiliations:
-;-
Venue:
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Year:
1995

Citing 0
Cited 4

Real-Time Schedulability Tests for Preemptive Multitasking

WPDRTS Selected papers from the 4th workshop on Parallel and distributed real-time systems
Schedulability Analysis of Periodic Fixed Priority Systems

IEEE Transactions on Computers
Measuring the Performance of Schedulability Tests

Real-Time Systems
Mathematical formalisms for performance evaluation of networks-on-chip

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

The rate monotonic scheduling algorithm is a commonly used task scheduling algorithm for periodic real time task systems. The paper discusses feasibility decision for a given real time task system by the rate monotonic scheduling algorithm. It presents a new necessary and sufficient condition for a given task system to be feasible, and a new feasibility decision algorithm based on that condition. The time complexity of this algorithm depends solely on the number of tasks. This algorithm can be applied to the inverse deadline scheduling algorithm, which is an extension of the rate monotonic scheduling algorithm.