Alternative Title
Performance Analysis of a Recursive Cyclic Scheduler for Class-based Scheduling
Publication Type
Journal Article
Version
publishedVersion
Publication Date
10-2006
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.
Keywords
Loop scheduler; Smoothness; Recursive; Class-aware scheduling
Discipline
Software Engineering
Research Areas
Software and Cyber-Physical Systems
Publication
Performance Evaluation
Volume
63
Issue
9
First Page
839
Last Page
863
ISSN
0166-5316
Identifier
10.1016/j.peva.2005.09.004
Publisher
Elsevier
Citation
ROM, Raphael; SIDI, Moshe; and TAN, Hwee-Pink.
Design and analysis of a class-aware recursive loop scheduler for class-based scheduling. (2006). Performance Evaluation. 63, (9), 839-863.
Available at: https://ink.library.smu.edu.sg/sis_research/2950
Copyright Owner and License
Authors
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1016/j.peva.2005.09.004
