This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Frame-Based Proportional Round-Robin
September 2006 (vol. 55 no. 9)
pp. 1121-1129
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.

[1] J. Anderson and A. Srinivasan, “Early-Release Fair Scheduling,” Proc. 12th Euromicro Conf. Real-Time Systems, pp. 35-43, June 2000.
[2] J. Anderson and A. Srinivasan, “Mixed Pfair/ERfair Scheduling of Asynchronous Periodic Tasks,” J. Computer and System Sciences, vol. 68, no. 1, pp. 157-204, Feb. 2004.
[3] S. Baruah, N. Cohen, C. Plaxton, and D. Varvel, “Proportionate Progress: A Notion of Fairness in Resource Allocation,” Algorithmica, vol. 15, no. 6, pp. 600-625, 1996.
[4] S. Baruah, J. Gehrke, and C. Plaxton, “Fast Scheduling of Periodic Tasks on Multiple Resources,” Proc. Ninth Int'l Parallel Processing Symp., pp. 280-288, Apr. 1995.
[5] A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” Proc. ACM SIGCOMM '89, pp. 1-12, Sept. 1989.
[6] K. Jeffay and S. Goddard, “A Theory of Rate-Based Execution,” Proc. IEEE Real-Time Systems Symp., pp. 304-314, 1999.
[7] K. Jeffay and S. Goddard, “Rate-Based Resource Allocation Models for Embedded Systems,” Lecture Notes in Computer Science, vol. 2211, p. 204, 2001.
[8] J. Nieh, C. Vaill, and H. Zhong, “Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler,” Proc. General Track: 2002 USENIX Ann. Technical Conf., pp. 245-259, June 2001.
[9] J. Nieh, C. Vaill, and H. Zhong, “Group Ratio Round-Robin: An O(1) Proportional Share Scheduler,” Proc. General Track: 2004 USENIX Ann. Technical Conf., pp. 245-259, June 2004.
[10] S. Ramabhadran and J. Pasquale, “Stratified Round Robin: A Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay,” Proc. ACM SIGCOMM, pp. 239-249, 2003.
[11] J. Regehr, M. Jones, and J. Stankovic, “Operating System Support for Multimedia: The Programming Model Matters,” Sept. 2000.
[12] A. Srinivasan, P. Holman, and J. Anderson, “The Case for Fair Multiprocessor Scheduling,” Proc. 11th Int'l Workshop Parallel and Distributed Real-Time Systems, Apr. 2003.
[13] I. Stoica, H. Abdel-Wahab, K. Jeffay, S. Baruah, J. Gehrke, and C. Plaxton, “A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems,” Proc. IEEE Real-Time Systems Symp., p. 288, Dec. 1996.
[14] C.A. Waldspurger, “Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management,” PhD Thesis No. MIT/LCS/TR-667, Dept. of Electrical Eng. and Computer Science, Massachusetts Inst. of Tech nology, 1995.
[15] D. Zhu, D. Mossé, and R. Melhem, “Multiple-Resource Periodic Scheduling Problem: How Much Fairness Is Necessary?” Proc. 24th IEEE Int'l Real-Time Systems Symp. (RTSS-03), pp. 142-151, Dec. 2003.

Index Terms:
Proportional fairness, ERfair, virtual time, real time, O(1) scheduling, round-robin.
Citation:
Arnab Sarkar, Partha P. Chakrabarti, Rajeev Kumar, "Frame-Based Proportional Round-Robin," IEEE Transactions on Computers, vol. 55, no. 9, pp. 1121-1129, Sept. 2006, doi:10.1109/TC.2006.148
Usage of this product signifies your acceptance of the Terms of Use.