Skip to main content
Article thumbnail
Location of Repository

Design and analysis of a class-aware recursive loop scheduler for class-based scheduling. Elsevier Journal of Performance Evaluation, 63(9–10), 839–863. Author Biographies Raphael Rom received the B.Sc. and M.Sc. degrees in Electrical Engineering from the

By Raphael Rom, Moshe Sidi and Hwee Pink Tan


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

Topics: Loop Scheduler, Smoothness, Recursive, Class-aware scheduling
Year: 2006
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.