Virtual-time round-robin: An O(1) proportional share scheduler

Proceedings of the 2001 USENIX Annual Technical Conference

Volumn , Issue , 2001, Pages

  Nieh, Jason ^a   Vaill, Chris ^a   Zhong, Hua ^a  

^a Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINUX; SCHEDULING ALGORITHMS;

FAIR QUEUEING ALGORITHMS; ORDERS OF MAGNITUDE; PROPORTIONAL SHARING; PROPORTIONAL-SHARE; PROPORTIONAL-SHARE MECHANISMS; RESOURCE MANAGEMENT; ROUND-ROBIN SCHEDULING; SHARED RESOURCES;

SCHEDULING;

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

References (34)

1. G. Banga, P. Druschel, and J. Mogul, “Resource Containers: A New Facility for Resource Management in Server Systems,” in Proceedings of the 3rd Symposium on Operating Systans Design and Implementation, USENIX, Berkeley, CA, Feb. 22-25 1999, pp. 45-58.
2. M. Beck, H. Bohme, M. Dziadzka, and U. Kunitz, Linux Kernel Internals. Reading, MA: Addison-Wesley, 2nd ed., 1998.
3. 2Q: Worst-case Fair Weighted Fair Queueing,” in Proceedings of INFOCOM'96, San Francisco, CA, Mar. 1996.
4. G. Bollella and K. Jeffay, “Support for Real-Time Computing Within General Purpose Operating Systems: Supporting Coresident Operating Systems,” in Proceedings of the Real-Time Technology and Applications Symposium, IEEE Computer Society Press, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1995, pp. 4-14.
5. R. Bryant and B. Hartner, “Java Technology, Threads, and Scheduling in Linux,” IBM developerWorks Library Paper, IBM Linux Technology Center, Jan. 2000.
6. G. Coulson, A. Campbell, P. Robin, G. Blair, M. Papathomas, and D. Hutchinson, “Design of a QoS Controlled ATM Based Communication System in Chorus,” in IEEE Journal of Selected Areas in Communications (JSAC), 13(4), May 1995, pp. 686-699.
7. H. Custer, Inside Windows NT. Redmond, WA, USA: Microsoft Press, 1993.
8. A. Demers, S. Keshav, and S. Shenker, “Analysis and Simulation of a Fair Queueing Algorithm,” in Proceedings of ACM SIGCOMM'89, Austin, TX, Sept. 1989, pp. 1-12.
9. K. Duda and D. Cheriton, “Borrowed-Virtual-Time (BVT) Scheduling: Supporting Latency-Sensitive Threads in a General-Purpose Scheduler,” in Proceedings of the 17th Symposium on Operating Systems Principles, ACM Press, New York, Dec. 1999, pp. 261-276.
10. R. Essick, “An Event-Based Fair Share Scheduler,” in Proceedings of the Winter 1990 USENIX Conference, USENIX, Berkeley, CA, USA, Jan. 1990, pp. 147-162.
11. S. Evans, K. Clarke, D. Singleton, and B. Smaalders, “Optimizing Unix Resource Scheduling for User Interaction,” in 1993 Summer Usenix, USENIX, June 1993, pp. 205-218.
12. E. Gafni and D. Bertsekas, “Dynamic Control of Session Input Rates in Communication Networks,” in IEEE Transactions on Automatic Control, 29(10), 1984, pp. 1009-1016.
13. D. Golub, “Operating System Support for Coexistence of RealTime and Conventional Scheduling,” Tech. Rep. CMU-CS-94-212, School of Computer Science, Carnegie Mellon University, Nov. 1994.
14. P. Goyal, X. Guo, and H. Vin, “A Hierarchical CPU Scheduler for Multimedia Operating System,” in Proceedings of the Second Symposium on Operating Systems Design and Implementation, USENIX, Berkeley, CA, Oct. 1996, pp. 107-121.
15. E. Hahne and R. Gallager, “Round Robin Scheduling for Fair Flow Control in Data Communication Networks,” Tech. Rep. LIDS-TH-1631, Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Dec. 1986.
16. G. Henry, “The Fair Share Scheduler,” AT&T Bell Laboratories Technical Journal, 63(8), Oct. 1984, pp. 1845-1857.
17. M. Jones, D. Roşu, and M. Roşu, “CPU Reservations and Time Constraints: Efficient, Predictable Scheduling of Independent Activities,” in Proceedings of the 16th Symposium on Operating Systems Principles, ACM Press, New York, Oct. 1997, pp. 198-211.
18. J. Kay and P. Lauder, “A Fair Share Scheduler,” Communications of the ACM, 31(1), Jan. 1988, pp. 44-55.
19. L. Kleinrock, Queueing Systems, Volume II: Computer Applications. New York: John Wiley & Sons, 1976.
20. I. Lehoczky, L. Sha, and Y. Ding, “The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior,” in Proceedings of the Real-Time Systems Symposium - 1989, IEEE Computer Society Press, Santa Monica, California, USA, Dec. 1989, pp. 166-171.
21. C. Liu and J. Layland, “Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment,” Journal of the ACM, 20(1), Jan. 1973, pp. 46-61.
22. C. Locke, Best-Effort Decision Making for Real-Time Scheduling. PhD thesis, Department of Computer Science, Carnegie-Mellon University, May 1986.
23. C. Mercer, S. Savage, and H. Tokuda, “Processor Capacity Reserves: Operating System Support for Multimedia Applications,” in Proceedings of the International Conference on Multimedia Computing and Systems, IEEE Computer Society Press, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, 1994, pp. 90-99.
24. J. Nieh and M. Lam, “The Design, Implementation and Evaluation of SMART: A Scheduler for Multimedia Applications,” in Proceedings of the 16th Symposium on Operating Systems Principles, 31(5), ACM Press, New York, Oct. 5-8 1997, pp. 184-197.
25. 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), June 1993, pp. 344-357.
26. K. Ramakrishnan, D. Chiu, and R. Jain, “Congestion Avoidance in Computer Networks with a Connectionless Network Layer, Part IV: A Selective Binary Feedback Scheme for General Topologies,” Tech. Rep. DEC-TR-510, DEC, Nov. 1987.
27. B. Shneiderman, Designing the User Interface: Strategies for Effective Human-Computer Interaction. Reading, MA: Addison-Wesley, 2nd ed., 1992.
28. M. Shreedhar and G. Varghese, “Efficient Fair Queueing Using Deficit Round-Robin,” in Proceedings of ACM SIGCOMM'95, 4(3), Sept. 1995, pp. 231-242.
29. A. Silberschatz and P. Galvin, Operating System Concepts. Reading, MA, USA: Addison-Wesley, 5th ed., 1998.
30. I. Stoica, H. Abdel-Wahab, and K. Jeffay, “On the Duality between Resource Reservation and Proportional Share Resource Allocation,” in Multimedia Computing and Networking Proceedings, SPIE Proceedings Series, 3020, Feb. 1997, pp. 207-214.
31. “UNIX System V Release 4 Internals Student Guide, Vol. I, Unit 2.4.2.” AT&T, 1990.
32. R. Tijdeman, “The Chairman Assignment Problem,” Discrete Mathematics, 32, 1980, pp. 323-330.
33. C. Waldspurger, Lottery and Stride Scheduling: Flexible Proportional-Share Resource Management. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Sept. 1995.
34. L. Zhang, “Virtual Clock: A New Traffic Control Algorithm for Packet Switched Networks,” in ACM Transactions on Computer Systems, 9(2), May 1991, pp. 101-125.