Rate-Based Resource Allocation Models for Embedded Systems
EMSOFT '01 Proceedings of the First International Workshop on Embedded Software
Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
The Case for Fair Multiprocessor Scheduling
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Lottery and stride scheduling: flexible proportional-share resource management
Lottery and stride scheduling: flexible proportional-share resource management
Multiple-Resource Periodic Scheduling Problem: how much fairness is necessary?
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
Partition oriented frame based fair scheduler
Journal of Parallel and Distributed Computing
| Hi-index | 14.99 |
All known real-time proportional fair scheduling mechanisms either have high scheduling overheads (O(lgn) per time-slot) or do not efficiently handle dynamic task sets. This paper presents Frame-Based Proportional Round-Robin (FBPRR), a real-time fair scheduler providing high and bounded proportional fairness accuracy and O(1) scheduling overhead with the ability to efficiently handle a set of dynamic tasks. FBPRR achieves this by applying the benefits of Virtual-Time Round-Robin (VTRR) scheduling mechanism within a frame-based scheduling approach. Simulation results show that the algorithm gains a speedup of 5 to 20 times (over O(lgn) complexity schedulers) with fairly high fairness.