A modified version of rate-monotonic scheduling algorithm and its' efficiency assessment
- 25 June 2003
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings of the Seventh IEEE International Workshop on Object-Oriented Real-Time Dependable Systems. (WORDS 2002)
Abstract
Scheduling algorithms play a significant role in the design of real-time Computing systems. Rate-monotonic, deadline-monotonic, relative urgency and least laxity algorithms are the most commonly used algorithms. It is already proved that rate-monotonic (RM) is an optimal fixed priority algorithm and many practical safety verification algorithms are developed [1, 2, 3, 4]. Here, an improvement to lower bound processor load factor for some special cases is presented. We then established a modified version of the rate-monotonic algorithm named delayed rate-monotonic (DRM) algorithm that uses two ready states, instead of one. For two special cases we showed full processor utilization is possible. Two algorithms, namely DRM and RM, are then compared and it is shown that there are many systems that are safe with DRM algorithm but are unsafe with RM algorithm. Also, for a set of randomly generated systems number of task preemptions for the two algorithms is compared. It is concluded that DRM is very promising and it has the potential to be considered for future research.Keywords
This publication has 12 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Minimum achievable utilization for fault-tolerant processing of periodic tasksInternational Conference on Acoustics, Speech, and Signal Processing (ICASSP), 1998
- A Feasibility Decision Algorithm for Rate Monotonic and Deadline Monotonic SchedulingReal-Time Systems, 1998
- Fault-Tolerant Rate-Monotonic SchedulingReal-Time Systems, 1998
- An extendible approach for analyzing fixed priority hard real-time tasksReal-Time Systems, 1994
- Generalized rate-monotonic scheduling theory: a framework for developing real-time systemsProceedings of the IEEE, 1994
- Fixed priority scheduling of periodic task sets with arbitrary deadlinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- On the complexity of fixed-priority scheduling of periodic, real-time tasksPerformance Evaluation, 1982
- Prevention of task overruns in real-time non-preemptive multiprogramming systemsACM SIGMETRICS Performance Evaluation Review, 1980
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973