Communications of the ACM
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
VirtualClock: a new traffic control algorithm for packet-switched networks
ACM Transactions on Computer Systems (TOCS)
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round robin
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing algorithms for packet-switched networks
IEEE/ACM Transactions on Networking (TON)
Time-shift scheduling—fair scheduling of flows in high-speed networks
IEEE/ACM Transactions on Networking (TON)
SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Virtual-Time Round-Robin: An O(1) Proportional Share Scheduler
Proceedings of the General Track: 2002 USENIX Annual Technical Conference
A proportional share resource allocation algorithm for real-time, time-shared systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Understanding the Linux Kernel, Second Edition
Understanding the Linux Kernel, Second Edition
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
Surplus fair scheduling: a proportional-share CPU scheduling algorithm for symmetric multiprocessors
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
WF2Q: worst-case fair weighted fair queueing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Hardware-efficient fair queueing architectures for high-speed networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Implementing scheduling algorithms in high-speed networks
IEEE Journal on Selected Areas in Communications
Group round robin: improving the fairness and complexity of packet scheduling
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Grouped distributed queues: distributed queue, proportional share multiprocessor scheduling
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Efficient scheduling algorithm for component-based networks
Future Generation Computer Systems
PBS: a unified priority-based scheduler
Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Efficient and scalable multiprocessor fair scheduling using distributed weighted round-robin
Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming
Dominant resource fairness: fair allocation of multiple resource types
Proceedings of the 8th USENIX conference on Networked systems design and implementation
A VM-aware fairness scheduler on heterogenous multi-core platforms
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Analysis of the effects of weight distribution on proportional share scheduling
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Fairness scheduler for virtual machines on heterogonous multi-core platforms
ACM SIGAPP Applied Computing Review
Uncovering CPU load balancing policies with harmony
Proceedings of the ACM International Conference on Computing Frontiers
Hi-index | 0.00 |
We present Group Ratio Round-Robin (GR3), the first proportional share scheduler that combines accurate proportional fairness scheduling behavior with O(1) scheduling overhead on both uniprocessor and multiprocessor systems. GR3 uses a simple grouping strategy to organize clients into groups of similar processor allocations which can be more easily scheduled. Using this strategy, GR3 combines the benefits of low overhead round-robin execution with a novel ratio-based scheduling algorithm. GR3 introduces a novel frontlog mechanism and weight readjustment algorithm to operate effectively on multiprocessors. GR3 provides fairness within a constant factor of the ideal generalized processor sharing model for client weights with a fixed upper bound and preserves its fairness properties on multiprocessor systems. We have implemented GR3 in Linux and measured its performance. Our experimental results show that GR3 provides much lower scheduling overhead and much better scheduling accuracy than other schedulers commonly used in research and practice.