The average response time in a heavy-traffic srpt queue

Authors:
Minghong Lin;Adam Wierman;Bert Zwart
Affiliations:
CMS, California Institute of Technology;CMS, California Institute of Technology;CWI Amsterdam, VU University Amsterdam, Eurandom & Georgia Tech.
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2010

Citing 8
Cited 0

Size-based scheduling to improve web performance

ACM Transactions on Computer Systems (TOCS)
Efficiency-Driven Heavy-Traffic Approximations for Many-Server Queues with Abandonments

Management Science
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Handling load with less stress

Queueing Systems: Theory and Applications
Fairness and classifications

ACM SIGMETRICS Performance Evaluation Review
Tails in scheduling

ACM SIGMETRICS Performance Evaluation Review
Optimality, fairness, and robustness in speed scaling designs

Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the average sojourn time under M/M/1/SRPT

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such, it has been the focus of a wide body of analysis. However, results about the heavy-traffic behavior of SRPT have only recently started to emerge. In this work, we characterize the growth rate of the mean response time under SRPT in the M/GI/1 system under general job size distributions. Our results illustrate the relationship between the job size tail and the heavy traffic growth rate of mean response time. Further, we show that the heavy traffic growth rate can be used to provide an accurate approximation for mean response time outside of heavy traffic.