Group ratio round-robin: O(1) proportional share scheduling for uniprocessor and multiprocessor systems

USENIX 2005 Annual Technical Conference

Volumn , Issue , 2005, Pages 337-352

  Caprita, Bogdan ^a   Chan, Wong Chun ^a   Nieh, Jason ^a   Stein, Clifford ^a   Zheng, Haoqiang ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING SYSTEMS; MULTIPROCESSING SYSTEMS; SCHEDULING;

FAIRNESS PROPERTIES; GENERALIZED PROCESSOR SHARING; GROUPING STRATEGIES; MULTI PROCESSOR SYSTEMS; PROCESSOR ALLOCATION; PROPORTIONAL FAIRNESS SCHEDULING; PROPORTIONAL-SHARE; SCHEDULING ACCURACY;

SCHEDULING ALGORITHMS;

EID: 47649110802     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (28)

1. 2Q: Worst-Case Fair Weighted Fair Queueing. In Proceedings of IEEE INFOCOM’96, pages 120–128, San Francisco, CA, Mar. 1996.
2. D. Bovet and M. Cesati. Understanding the Linux Kernel. O’Reilly, Sebastopol, CA, second edition, 2002.
3. R. Bryant and B. Hartner. Java Technology, Threads, and Scheduling in Linux. IBM developerWorks Library Paper. IBM Linux Technology Center, Jan. 2000.
4. B. Caprita, W. C. Chan, and J. Nieh. Group Round-Robin: Improving the Fairness and Complexity of Packet Scheduling. Technical Report CUCS-018-03, Columbia University, June 2003.
5. W. C. Chan. Group Ratio Round-Robin: An O(1) Proportional Share Scheduler. Master’s thesis, Columbia University, June 2004.
6. W. C. Chan and J. Nieh. Group Ratio Round-Robin: An O(1) Proportional Share Scheduler. Technical Report CUCS-012-03, Columbia University, Apr. 2003.
7. A. Chandra, M. Adler, P. Goyal, and P. J. Shenoy. Surplus Fair Scheduling: A Proportional-Share CPU Scheduling Algorithm for Symmetric Multiprocessors. In Proceedings of the 4th Symposium on Operating System Design & Implementation, pages 45–58, San Diego, CA, Oct. 2000.
8. S. Y. Cheung and C. S. Pencea. BSFQ: Bin-Sort Fair Queueing. In Proceedings of IEEE INFOCOM’02, pages 1640–1649, New York, NY, June 2002.
9. G. Chuanxiong. SRR: An O(1) Time Complexity Packet Scheduler for Flows in Multi-Service Packet Networks. In Proceedings of ACM SIGCOMM’01, pages 211–222, San Diego, CA, Aug. 2001.
10. J. Cobb, M. Gouda, and A. El-Nahas. Time-Shift Scheduling – Fair Scheduling of Flows in High-Speed Networks. IEEE/ACM Transactions on Networking, pages 274–285, June 1998.
11. A. Demers, S. Keshav, and S. Shenker. Analysis and Simulation of a Fair Queueing Algorithm. In Proceedings of ACM SIGCOMM’89, pages 1–12, Austin, TX, Sept. 1989.
12. R. Essick. An Event-Based Fair Share Scheduler. In Proceedings of the Winter 1990 USENIX Conference, pages 147–162, Berkeley, CA, Jan. 1990. USENIX.
13. P. Goyal, H. Vin, and H. Cheng. Start-Time Fair Queueing: A Scheduling Algorithm for Integrated Services Packet Switching Networks. IEEE/ACM Transactions on Networking, pages 690–704, Oct. 1997.
14. G. Henry. The Fair Share Scheduler. AT&T Bell Laboratories Technical Journal, 63(8):1845–1857, Oct. 1984.
15. J. Kay and P. Lauder. A Fair Share Scheduler. Commun. ACM, 31(1):44–55, 1988.
16. L. Kleinrock. Computer Applications, volume II of Queueing Systems. John Wiley & Sons, New York, NY, 1976.
17. J. Nieh, C. Vaill, and H. Zhong. Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler. In Proceedings of the 2001 USENIX Annual Technical Conference, pages 245–259, Berkeley, CA, June 2001. USENIX.
18. A. Parekh and R. Gallager. A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case. IEEE/ACM Transactions on Networking, 1(3):344–357, June 1993.
19. S. Ramabhadran and J. Pasquale. Stratified Round Robin: a Low Complexity Packet Scheduler with Bandwidth Fairness and Bounded Delay. In Proceedings of ACM SIGCOMM ’03, pages 239–250, Karlsruhe, Germany, Aug. 2003.
20. J. Rexford, A. G. Greenberg, and F. Bonomi. Hardware-Efficient Fair Queueing Architectures for High-Speed Networks. In Proceedings of IEEE INFOCOM’96, pages 638–646, Mar. 1996.
21. R. Russell. Hackbench: A New Multiqueue Scheduler Benchmark. http://www.lkml.org/archive/2001/12/11/19/index.html, Dec. 2001. Message to Linux Kernel Mailing List.
22. M. Shreedhar and G. Varghese. Efficient Fair Queueing using Deficit Round Robin. In Proceedings of ACM SIGCOMM’95, pages 231–242, Sept. 1995.
23. D. Stephens, J. Bennett, and H. Zhang. Implementing Scheduling Algorithms in High Speed Networks. IEEE JSAC Special Issue on High Performance Switches/Routers, Sept. 1999.
24. D. Stiliadis and A. Varma. Efficient Fair Queueing Algorithms for Packet-Switched Network. IEEE/ACM Transactions on Networking, pages 175–185, Apr. 1998.
25. I. Stoica, H. Abdel-Wahab, K. Jeffay, S. Baruah, J. Gehrke, and G. Plaxton. A Proportional Share Resource Allocation Algorithm for Real-Time, Time-Shared Systems. In Proceedings of the 17th IEEE Real-Time Systems Symposium, pages 288 – 289, Dec. 1996.
26. C. Waldspurger. Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management. PhD thesis, Dept. of EECS, MIT, Sept. 1995.
27. J. Xu and R. J. Lipton. On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms. In Proceedings of ACM SIGCOMM ’02, pages 279–292, Aug. 2002.
28. L. Zhang. Virtualclock: a New Traffic Control Algorithm for Packet-Switched Networks. ACM Transactions on Computer Systems, 9(2):101–124, May 1991.