Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Rate monotonic vs. EDF: judgment day
Real-Time Systems
Efficient Feasibility Analysis for Real-Time Systems with EDF Scheduling
Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
A precise schedulability test algorithm for scheduling periodic tasks in real-time systems
Proceedings of the 2006 ACM symposium on Applied computing
A faster exact schedulability analysis for fixed-priority scheduling
Journal of Systems and Software
A methodology for designing hierarchical scheduling systems
Journal of Embedded Computing - Real-Time Systems (Euromicro RTS-03)
Instruction-set customization for real-time embedded systems
Proceedings of the conference on Design, automation and test in Europe
Revisiting fixed priority techniques
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Sharing resources among independently-developed systems on multi-cores
ACM SIGBED Review
Multi-level hierarchical scheduling in ethernet switches
EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Optimization of task allocation and priority assignment in hard real-time distributed systems
ACM Transactions on Embedded Computing Systems (TECS)
Lowest priority first based feasibility analysis of real-time systems
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodictasks. They can be divided in two main classes: polynomial time tests and exact tests. Polynomial time tests are used for on-line guarantee of dynamic systems, where tasks can be activated at runtime. These tests introduce a negligible overhead, when executed upon a new task arrival, however provide only a sufficient schedulability condition, which may cause a poor processor utilization. On the other hand, exact tests, which are based on response time analysis, provide a necessary and sufficient schedulability condition, but are too complex to be executed on line for large task sets. As a consequence, for large task sets, they are often executed off line.This paper proposes a novel approach for analyzing the schedulability of periodic task sets under the Rate Monotonic priority assignment. Using this approach, we derive a new schedulability test which can be tuned through a parameter to balance complexity vs. acceptance ratio, so that it can be used on line to better exploit the processor, based on the available computational power. Extensive simulations show that our test, when used in its exact form, is significantly faster than the current response time analysis methods.Moreover the proposed approach, for its elegance and compactness, offers an explanation of some known phenomena of fixed priority scheduling and could be helpful for further work on the Rate Monotonic analysis.