The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments
IEEE Transactions on Computers
Allocating fixed-priority periodic tasks on multiprocessor systems
Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Liu and Layland's schedulability test revisited
Information Processing Letters
Real-Time Systems
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Improved Response-Time Analysis Calculations
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
A Hyperbolic Bound for the Rate Monotonic Algorithm
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Schedulability Analysis of Periodic Fixed Priority Systems
IEEE Transactions on Computers
Real Time Scheduling Theory: A Historical Perspective
Real-Time Systems
Measuring the Performance of Schedulability Tests
Real-Time Systems
Rate monotonic schedulability tests using period-dependent conditions
Real-Time Systems
Uniprocessor scheduling under precedence constraints for embedded systems design
ACM Transactions on Embedded Computing Systems (TECS)
Analysis on quantum-based fixed priority scheduling of real-time tasks
Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication
Quantitative analysis and systematic parametrization of a two-level real-time scheduler
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Using improved resource interfaces to formally describe adaptability in embedded systems
ACM SIGBED Review - Special Issue on the 2nd International Workshop on Adaptive and Reconfigurable Embedded Systems (APRES'09)
Constant-time admission control for deadline monotonic tasks
Proceedings of the Conference on Design, Automation and Test in Europe
Fault tolerance with real-time java
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Comments on "Generalized rate monotonic schedulability bounds using relative period ratios"
Information Processing Letters
Reliability comparison of schedulability test in ubiquitous computing
UIC'11 Proceedings of the 8th international conference on Ubiquitous intelligence and computing
ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
Power efficient rate monotonic scheduling for multi-core systems
Journal of Parallel and Distributed Computing
Optimal task execution times for periodic tasks using nonlinear constrained optimization
The Journal of Supercomputing
High performance dynamic voltage/frequency scaling algorithm for real-time dynamic load management
Journal of Systems and Software
Sharp utilization thresholds for some realtime scheduling problems
ACM SIGMETRICS Performance Evaluation Review
Robustness analysis for battery-supported cyber-physical systems
ACM Transactions on Embedded Computing Systems (TECS)
Mathematical formalisms for performance evaluation of networks-on-chip
ACM Computing Surveys (CSUR)
Hi-index | 14.98 |
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, thus allowing it 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.