Analysis of the effects of weight distribution on proportional share scheduling

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.