RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Rate Monotonic Analysis: The Hyperbolic Bound
IEEE Transactions on Computers
Rate monotonic vs. EDF: judgment day
Real-Time Systems
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
ACM Transactions on Embedded Computing Systems (TECS)
Analysis and optimisation of hierarchically scheduled multiprocessor embedded systems
International Journal of Parallel Programming - Special Issue on Multiprocessor-based embedded systems
Generalized rate monotonic schedulability bounds using relative period ratios
Information Processing Letters
Delay composition in preemptive and non-preemptive real-time pipelines
Real-Time Systems
Constant-time admission control for deadline monotonic tasks
Proceedings of the Conference on Design, Automation and Test in Europe
Utilization bound for periodic task set with composite deadline
Computers and Electrical Engineering
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Nonutilization bounds and feasible regions for arbitrary fixed-priority policies
ACM Transactions on Embedded Computing Systems (TECS)
A comparative study of rate monotonic schedulability tests
The Journal of Supercomputing
Proceedings of the International Conference on Computer-Aided Design
Probabilistic modelling and evaluation of soft real-time embedded systems
SAMOS'06 Proceedings of the 6th international conference on Embedded Computer Systems: architectures, Modeling, and Simulation
Proceedings of the 20th International Conference on Real-Time and Network Systems
Lowest priority first based feasibility analysis of real-time systems
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
Abstract: In this paper we propose a novel schedulability analysis for verifying the feasibility of large periodic task sets under the rate monotonic algorithm, when the exact test cannot be applied on line due to prohibitively long execution times. The proposed test has the same complexity as the original Liu and Layland bound but it is less pessimistic, so allowing to accept task sets that would be rejected using the original approach. The performance of the proposed approach is evaluated with respect to the classical Liu and Layland method, and theoretical bounds are derived as a function of n (the number of tasks) and for the limit case of n tending to infinity. The analysis is also extended to include aperiodic servers and blocking times due to concurrency control protocols. Extensive simulations on synthetic tasks sets are presented to compare the effectiveness of the proposed test with respect to the Liu and Layland method and the exact response time analysis.