A Feasibility Decision Algorithm for Rate Monotonic andDeadline Monotonic Scheduling

Authors:
Yoshifumi Manabe;Shigemi Aoyagi
Affiliations:
NTT Basic Research Laboratories, 3-1 Morinosato-Wakamiya, Atsugi-shi, Kanagawa, 243-01 Japan;NTT Basic Research Laboratories, 3-1 Morinosato-Wakamiya, Atsugi-shi, Kanagawa, 243-01 Japan
Venue:
Real-Time Systems
Year:
1998

Citing 7
Cited 5

Scheduling algorithms for hard real-time systems: a brief survey

Tutorial: hard real-time systems
Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
Stack-based scheduling for realtime processes

Real-Time Systems
Fixed priority pre-emptive scheduling: an historical perspective

Real-Time Systems - Special issue: history of real-time systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
A Systematic Approach to Designing Distributed Real-Time Systems

Computer
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers

SASEPA: Simultaneous Allocation and Scheduling with Exclusion and Precedence Relations Algorithm

PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
Approximation techniques for response-time analysis of static-priority tasks

Real-Time Systems
Revisiting fixed priority techniques

EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
A comparative study of rate monotonic schedulability tests

The Journal of Supercomputing
Lowest priority first based feasibility analysis of real-time systems

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Rate monotonic and deadline monotonic scheduling arecommonly used for periodic real-time task systems. This paperdiscusses a feasibility decision for a given real-time task systemwhen the system is scheduled by rate monotonic and deadline monotonicscheduling. The time complexity of existing feasibility decisionalgorithms depends on both the number of tasks and maximum periodsor deadlines when the periods and deadlines are integers. Thispaper presents a new necessary and sufficient condition for agiven task system to be feasible and proposes a new feasibilitydecision algorithm based on that condition. The time complexityof this algorithm depends solely on the number of tasks. Thiscondition can also be applied as a sufficient condition for atask system using priority inheritance protocols to be feasiblewith rate monotonic and deadline monotonic scheduling.