Performance Analysis of a Recursive Cyclic 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.
Loop scheduler; Smoothness; Recursive; Class-aware scheduling
Software and Cyber-Physical Systems
R. Rom; M. Sidi; and TAN, Hwee-Pink.
Performance Analysis of a Recursive Cyclic Scheduler for Class-based Scheduling. (2006). Performance Evaluation. 63, (9), 839-863. Research Collection School Of Information Systems.
Available at: http://ink.library.smu.edu.sg/sis_research/2950
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
This document is currently not available here.