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

R. Rom, M. Sidi, H.P. Tan

    Research output: Contribution to journalArticleAcademicpeer-review

    1 Citation (Scopus)
    12 Downloads (Pure)

    Abstract

    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.
    Original languageEnglish
    Pages (from-to)839-863
    JournalPerformance Evaluation
    Volume63
    Issue number9-10
    DOIs
    Publication statusPublished - 2006

    Fingerprint

    Dive into the research topics of 'Design and analysis of a class-aware recursive loop scheduler for class-based scheduling'. Together they form a unique fingerprint.

    Cite this