Sciweavers

Share
PE
2006
Springer

Design and analysis of a class-aware recursive loop scheduler for class-based scheduling

9 years 3 months ago
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling
In this paper, we consider the problem of devising a loop scheduler that allocates slots to users according to their relative weights as smoothly as possible. Instead of the existing notion of smoothness based on balancedness, we propose a variance-based metric which is more intuitive and easier to compute. We propose a recursive loop scheduler for a class-based scheduling scenario based on an optimal weighted round-robin scheduler. We show that it achieves very good allocation smoothness with almost no degradation in intra-class fairness. In addition, we also demonstrate the equivalence between our proposed metric and the balancedness-based metric. c 2005 Elsevier B.V. All rights reserved.
Raphael Rom, Moshe Sidi, Hwee Pink Tan
Added 14 Dec 2010
Updated 14 Dec 2010
Type Journal
Year 2006
Where PE
Authors Raphael Rom, Moshe Sidi, Hwee Pink Tan
Comments (0)
books