The SimpleScalar tool set, version 2.0
ACM SIGARCH Computer Architecture News
Fast scheduling of periodic tasks on multiple resources
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Pfair scheduling: beyond periodic task systems
RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Pfair Scheduling of Fixed and Migrating Periodic Tasks on Multiple Resources
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks
ECRTS '01 Proceedings of the 13th Euromicro Conference on Real-Time Systems
Guaranteeing Pfair Supertasks by Reweighting
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
Journal of Computer and System Sciences
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Frame-Based Proportional Round-Robin
IEEE Transactions on Computers
Optimal virtual cluster-based multiprocessor scheduling
Real-Time Systems
T-L plane-based real-time scheduling for homogeneous multiprocessors
Journal of Parallel and Distributed Computing
A new fair scheduling algorithm for periodic tasks on multiprocessors
Information Processing Letters
Dominant resource fairness: fair allocation of multiple resource types
Proceedings of the 8th USENIX conference on Networked systems design and implementation
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
Swapping to reduce preemptions and migrations in EKG
ACM SIGBED Review - Work-in-Progress (WiP) Session of the 23rd Euromicro Conference on Real-Time Systems (ECRTS 2011)
| Hi-index | 0.00 |
The Pfair algorithms are optimal for independent periodicreal-time tasks executing on a multiple-resource system,however, they incur a high scheduling overhead bymaking scheduling decisions in every time unit to enforceproportional progress for each task. In this paper, we willpropose a novel scheduling algorithm, boundary fair (),which makes scheduling decisions and enforces fairness totasks only at period boundaries. The BF algorithm is alsooptimal in the sense that it achieves 100% system utilization.Moreover, by making scheduling decisions at periodboundaries, BF effectively reduces the number of schedulingpoints. Theoretically, the BF algorithm has the samecomplexity as that of the Pfair algorithms. But, in practice,it could reduce the number of scheduling points dramatically(e.g., upto 75% in our experiments) and thus reducethe overall scheduling overhead, which is especially importantfor on-line scheduling.