Invariance of fluid limits for the shortest remaining processing time and shortest job first policies

Authors:
H. Christian Gromoll;Martin Keutel
Affiliations:
Department of Mathematics, University of Virginia, Charlottesville, USA 22904;Department of Mathematics, University of Virginia, Charlottesville, USA 22904
Venue:
Queueing Systems: Theory and Applications
Year:
2012

Citing 6
Cited 0

Analysis of SRPT scheduling: investigating unfairness

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Asymptotic convergence of scheduling policies with respect to slowdown

Performance Evaluation
A large-deviations analysis of the GI/GI/1 SRPT queue

Queueing Systems: Theory and Applications
Scheduling despite inexact job-size information

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
State-dependent response times via fluid limits in shortest remaining processing time queues

ACM SIGMETRICS Performance Evaluation Review
Fluid Limits for Shortest Remaining Processing Time Queues

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a single-server queue with renewal arrivals and i.i.d. service times, in which the server employs either the preemptive Shortest Remaining Processing Time (SRPT) policy, or its non-preemptive variant, Shortest Job First (SJF). We show that for given stochastic primitives (initial condition, arrival and service processes), the model has the same fluid limit under either policy. In particular, we conclude that the well-known queue length optimality of preemptive SRPT is also achieved, asymptotically on fluid scale, by the simpler-to-implement SJF policy. We also conclude that on fluid scale, SJF and SRPT achieve the same performance with respect to state-dependent response times.