Analysis of round-robin variants: favoring newly arrived jobs

Authors:
Feng Zhang;Sarah Tasneem;Lester Lipsky;Steve Thompson
Affiliations:
University of Connecticut, Storrs, CT;University of Connecticut, Storrs, CT;University of Connecticut, Storrs, CT;University of Connecticut, Storrs, CT
Venue:
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Year:
2009

Citing 12
Cited 0

Efficient fair queueing using deficit round robin

SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Feedback Queueing Models for Time-Shared Systems

Journal of the ACM (JACM)
Scheduling for Minimum Total Loss Using Service Time Distributions

Journal of the ACM (JACM)
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers

Journal of the ACM (JACM)
Analysis of SRPT scheduling: investigating unfairness

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
The Importance of Power-Tail Distributions for Modeling Queueing Systems

Operations Research
Classifying scheduling policies with respect to unfairness in an M/GI/1

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Group round robin: improving the fairness and complexity of packet scheduling

Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Stability of size-based scheduling disciplines in resource-sharing networks

Performance Evaluation - Performance 2005
The Stratified Round Robin scheduler: design, analysis and implementation

IEEE/ACM Transactions on Networking (TON)
The Foreground-Background queue: A survey

Performance Evaluation
Queueing Theory: A Linear Algebraic Approach

Queueing Theory: A Linear Algebraic Approach

Quantified Score

Hi-index	0.00

Visualization

Abstract

Highly varying job demands generally consist of many short jobs mixed with several long jobs. In principle, without foreknowledge of exact service times of individual jobs, processor sharing is an effective theoretical strategy for handling such demands. In practice, however, processor sharing must be implemented by time-slicing, which incurs non-negligible job switching overhead for small time-slices. A research issue is then how time-slicing performs if large time-slices have to be used. In this paper, we investigate several round-robin variants and the results from Discrete Event Simulation show that, by favoring newly arrived jobs, the performance of round-robin with large time-slices could be better than that of ideal processor sharing. The simple immediate-preemption scheme, which serves the new jobs immediately by preempting the current active job, is shown to further improve the performance of round-robin.