Issue No.09 - September (2006 vol.55)
Rajeev Kumar , IEEE
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2006.148
All known real-time proportional fair scheduling mechanisms either have high scheduling overheads (O(lg n) 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(lg n) complexity schedulers) with fairly high fairness.
Proportional fairness, ERfair, virtual time, real time, O(1) scheduling, round-robin.
Arnab Sarkar, Rajeev Kumar, "Frame-Based Proportional Round-Robin", IEEE Transactions on Computers, vol.55, no. 9, pp. 1121-1129, September 2006, doi:10.1109/TC.2006.148