Concrete Math
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
New Strategies for Assigning Real-Time Tasks to Multiprocessor Systems
IEEE Transactions on Computers
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Fairness in periodic real-time scheduling
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Parallel Switching in Connection-Oriented Networks
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
An Efficient RMS Admission Control and its Application to Multiprocessor Scheduling
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem
Tight Performance Bounds of Heuristics for a Real-Time Scheduling Problem
Mixed Pfair/ERfair scheduling of asynchronous periodic tasks
Journal of Computer and System Sciences
Processing data streams with hard real-time constraints on heterogeneous systems
Proceedings of the international conference on Supercomputing
Scheduling processing of real-time data streams on heterogeneous multi-GPU systems
Proceedings of the 5th Annual International Systems and Storage Conference
| Hi-index | 0.00 |
We present a new sufficient condition for the schedulability of preemptable, periodic, hard-real-time task sets using the very simple static-priority weight-monotonic scheduling scheme. Like a previous condition due to Raruah et al., our condition actually determines pfair schedulability. Pfairness requires that the schedule, in addition to being periodic, schedules each task at an approximately even rate. Our condition improves on the previous one in two important ways. First, it can determine that task sets with high utilization and many tasks are schedulable, while the previous condition cannot. Second, our condition applies to both uniprocessors and multiprocessors, while the previous condition applies only to uniprocessors. We present simulations that show that our condition is highly accurate for many cases of interest.