Open Problem—M/G/k/SRPT Under Medium Load

Isaac Grosof · Stochastic Systems · 2019

The shortest remaining processing time (SRPT) scheduling policy has been deployed in many computer systems, such as web servers ( Harchol-Balter et al. 2003 ), networks ( Montazeri et al. 2018 ), databases ( Guirguis et al. 2009 ), and operating systems ( Bunt 1976 ). SRPT has also received extensive study by queueing theorists. In 1966, the mean response time for SRPT was first derived ( Schrage and Miller 1966 ), and in 1968, SRPT was shown to minimize mean response time ( Schrage 1968 ). However, these results are only known for single-server systems. Much less is known for multiserver systems, such as the M/G/k.

Read the paper · More papers on PaperTik