CPU reservations and time constraints: efficient, predictable scheduling of independent activities
Proceedings of the sixteenth ACM symposium on Operating systems principles
A Class of Rate-Based Real-Time Scheduling Algorithms
IEEE Transactions on Computers
Supporting Fault-Tolerant Real-Time Applications Using the RED-Linux General Scheduling Framework
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Real-Time Digital Signal Processing of Phased Array Radars
IEEE Transactions on Parallel and Distributed Systems
Real-Time Dwell Scheduling of Component-Oriented Phased Array Radars
IEEE Transactions on Computers
Vassal: loadable scheduler support for multi-policy scheduling
WINSYM'98 Proceedings of the 2nd conference on USENIX Windows NT Symposium - Volume 2
Scheduling algorithms for dynamic message streams with distance constraints in TDMA protocol
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
| Hi-index | 0.01 |
Several pinwheel schedulers have been reported previously for scheduling real-time systems in which the temporal distances between consecutive executions of tasks must be less than their respective distance constraints. The scheduler Sr has been used for task sets with real number distance constraints and execution times. Sr transforms the distance constraints in a system into harmonic values with a base of 2. The authors present a pinwheel scheduler Sr/sup b/ which is derived from Sr using any base greater than or equal to d. The schedulability condition of Sr/sup b/ is presented and its optimality is proved. They also study the performance of Sr/sup b/ by simulation and compare it with a near-optimal heuristic algorithm HSr.