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

• المؤلفون الرئيسيون: ROM, Raphael, SIDI, Moshe, TAN, Hwee-Pink
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2006
• الموضوعات: Loop scheduler; Smoothness; Recursive; Class-aware scheduling; Software Engineering
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/2950; https://ink.library.smu.edu.sg/context/sis_research/article/3950/viewcontent/Rom_2006_Design_and_analysis_of_a_class_awar.pdf
• المؤسسة: Singapore Management University

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.