State-dependent response times via fluid limits in shortest remaining processing time queues

Authors:
Douglas G. Down;H. Christian Gromoll;Amber L. Puha
Affiliations:
McMaster University;University of Virginia;California State University, San Marcos
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2009

Citing 3
Cited 2

Analysis of SRPT scheduling: investigating unfairness

Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Preventing Large Sojourn Times Using SMART Scheduling

Operations Research
Fluid Limits for Shortest Remaining Processing Time Queues

Mathematics of Operations Research

Fluid Limits for Shortest Remaining Processing Time Queues

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

Queueing Systems: Theory and Applications

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 the Shortest Remaining Processing Time (SRPT) policy. We provide a fluid model (or formal law of large numbers approximation) for this system. The foremost payoff of our fluid model is a fluid level approximation for the state-dependent response time of a job of arbitrary size, that is, the amount of time it spends in the system, given an arbitrary system configuration at the time of its arrival.