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

Authors:
Raphael Rom;Moshe Sidi;Hwee Pink Tan
Affiliations:
Department of Electrical Engineering, Technion, Israel Institute of Technology, Technion City, Israel;Department of Electrical Engineering, Technion, Israel Institute of Technology, Technion City, Israel;EURANDOM, Eindhoven University of Technology, Eindhoven, The Netherlands and Department of Electrical Engineering, Technion, Israel Institute of Technology
Venue:
Performance Evaluation
Year:
2006

Citing 14
Cited 1

Packet delay under the golden ratio weighted tdm policy in a multiple-access channel

IEEE Transactions on Information Theory
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
Efficient fair queueing using deficit round-robin

IEEE/ACM Transactions on Networking (TON)
Fair scheduling in wireless packet networks

SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Minimizing service and operation costs of periodic scheduling

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Time-shared Systems: a theoretical treatment

Journal of the ACM (JACM)
Balanced sequences and optimal routing

Journal of the ACM (JACM)
SRR: An O(1) time complexity packet scheduler for flows in multi-service packet networks

Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Nearly optimal perfectly-periodic schedules

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
General perfectly periodic scheduling

Proceedings of the twenty-first annual symposium on Principles of distributed computing
Scheduling Periodic Task Systems to Minimize Output Jitter

RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
m-Balanced words: a generalization of balanced words

Theoretical Computer Science
A resource-allocation queueing fairness measure

Proceedings of the joint international conference on Measurement and modeling of computer systems
Class-based quality of service over air interfaces in 4G mobile networks

IEEE Communications Magazine

Analysis of performance trade-offs for an adaptive channel-aware wireless scheduler

Wireless Networks

Quantified Score

Hi-index	0.00

Visualization

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.