Analysis of the effects of weight distribution on proportional share scheduling

Authors:
AhReum Kim;Jinman Jung;Joonhyouk Jang;Sang Cheol Kim
Affiliations:
Soongsil University, Korea;Seoul National University, Korea;Seoul National University, Korea;Electronics and Telecommunications Research Institute, Korea
Venue:
Proceedings of the 2012 ACM Research in Applied Computation Symposium
Year:
2012

Citing 6
Cited 0

Efficient fair queueing using deficit round robin

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
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
Lottery and stride scheduling: flexible proportional-share resource management

Lottery and stride scheduling: flexible proportional-share resource management
Group ratio round-robin: O(1) proportional share scheduling for uniprocessor and multiprocessor systems

ATEC '05 Proceedings of the annual conference on USENIX Annual Technical Conference
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Proportional share scheduling algorithms have been widely studied as means of guaranteeing the QoS of applications. These algorithms allocate CPU resources to tasks based on their weight, but most are designed to behave differently under variations in overall weight distribution and number of tasks. In this paper, we classify proportional share scheduling algorithms according to these differences in behavior and analyze the levels of QoS they achieve. Our analysis shows that variations in weight distribution and number of tasks have a significant impact on QoS. Based on this analysis, we further explain which algorithms are best suited to various environments.