Fixed-priority scheduling of real-time systems using utilization bounds
Journal of Systems and Software
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Real-time queueing network theory
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Schedulability Analysis and Utilization Bounds for Highly Scalable Real-Time Services
RTAS '01 Proceedings of the Seventh Real-Time Technology and Applications Symposium (RTAS '01)
Rate Monotonic Analysis: The Hyperbolic Bound
IEEE Transactions on Computers
Power-aware QoS Management in Web Servers
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Enhanced Utilization Bounds for QoS Management
IEEE Transactions on Computers
A Utilization Bound for Aperiodic Tasks and Priority Driven Scheduling
IEEE Transactions on Computers
A Feasible Region for Meeting Aperiodic End-to-End Deadlines in Resource Pipelines
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
Integrated Resource Management and Scheduling with Multi-Resource Constraints
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Finite-Horizon Scheduling of Radar Dwells with Online Template Construction
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
On Schedulability Bounds of Static Priority Schedulers
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
Measuring the Performance of Schedulability Tests
Real-Time Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Sustainable Scheduling Analysis
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Dynamic Voltage Scaling in Multitier Web Servers with End-to-End Delay Control
IEEE Transactions on Computers
Statistical QoS Guarantee and Energy-Efficiency in Web Server Clusters
ECRTS '07 Proceedings of the 19th Euromicro Conference on Real-Time Systems
Sharp Thresholds for Scheduling Recurring Tasks with Distance Constraints
IEEE Transactions on Computers
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Journal of Systems and Software
A General Framework for Parameterized Schedulability Bound Analysis of Real-Time Systems
IEEE Transactions on Computers
Hard and easy distributions of SAT problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
An Empirical Comparison of Global, Partitioned, and Clustered Multiprocessor EDF Schedulers
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Hi-index | 0.00 |
Scheduling policies for real-time systems exhibit threshold behavior that is related to the utilization of the task set they schedule, and in some cases this threshold is sharp. A task set is considered schedulable if it can be scheduled to meet all associated deadlines. A schedulability test for a chosen policy is a test of feasibility: given a task set, can all deadlines be met? For the rate monotonic scheduling policy, we show that periodic workload with utilization less than a threshold URM can be scheduled almost surely and that all workload with utilization greater than URM is almost surely not schedulable. We study such sharp threshold behavior in the context of processor scheduling using static task priorities, not only for periodic real-time tasks but for aperiodic real-time tasks as well. The notion of a utilization threshold provides a simple schedulability test for most real-time applications. These results improve our understanding of scheduling policies and provide an interesting characterization of the typical behavior of policies. The threshold is sharp (small deviations around the threshold cause schedulability, as a property, to appear or disappear) for most policies; this is a happy consequence that can be used to address the limitations of existing utilization-based tests for schedulability. We demonstrate the use of such an approach for balancing power consumption with the need to meet deadlines in web servers.