SRPT for Multiserver Systems

The Shortest Remaining Processing Time (SRPT) scheduling policy and its variants have been extensively studied in both theoretical and practical settings. While beautiful results are known for single-server SRPT, much less is known for multiserver SRPT. In particular, stochastic analysis of the M/G/k under SRPT is entirely open. Intuition suggests that multiserver SRPT should be optimal or near-optimal for minimizing mean response time. However, the only known analysis of multiserver SRPT is in the worst-case adversarial setting, where SRPT can be far from optimal. In this paper, we give the first stochastic analysis bounding mean response time of the M/G/k under SRPT. Using our response time bound, we show that multiserver SRPT has asymptotically optimal mean response time in the heavy-traffic limit. The key to our bounds is a strategic combination of stochastic and worst-case techniques. Beyond SRPT, we prove similar response time bounds and optimality results for several other multiserver scheduling policies. This article is an introduction to our longer paper, [1].

[1]  Adam Wierman,et al.  Nearly insensitive bounds on SMART scheduling , 2005, SIGMETRICS '05.

[2]  Dipankar Raychaudhuri,et al.  Size matters: size-based scheduling for MPEG-4 over wireless channels , 2003, IS&T/SPIE Electronic Imaging.

[3]  Adam Wierman,et al.  The Foreground-Background queue: A survey , 2008, Perform. Evaluation.

[4]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

[5]  Stefano Leonardi,et al.  Approximating total flow time on parallel machines , 1997, STOC '97.

[6]  Kirk Pruhs,et al.  Adaptive Scheduling of Web Transactions , 2009, 2009 IEEE 25th International Conference on Data Engineering.

[7]  Mor Harchol-Balter,et al.  Size-based scheduling to improve web performance , 2003, TOCS.

[8]  Adam Wierman,et al.  Classifying scheduling policies with respect to unfairness in an M/GI/1 , 2003, SIGMETRICS '03.

[9]  Minghong Lin,et al.  Heavy-traffic analysis of mean response time under Shortest Remaining Processing Time , 2011, Perform. Evaluation.

[10]  Linus Schrage,et al.  The Queue M/G/1 with the Shortest Remaining Processing Time Discipline , 1966, Oper. Res..

[11]  Mor Harchol-Balter,et al.  SRPT for Multiserver Systems , 2019, PERV.

[12]  Richard B. Bunt,et al.  Scheduling Techniques for Operating Systems , 1976, Computer.

[13]  J. George Shanthikumar,et al.  Scheduling Multiclass Single Server Queueing Systems to Stochastically Maximize the Number of Successful Departures , 1989, Probability in the Engineering and Informational Sciences.