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

References

• Bunt RB (1976) Scheduling techniques for operating systems. Comput. 9(10):10–17.Google Scholar
• Daley DJ (1997) Some results for the mean waiting-time and workload in GI/GI/K queues. Dshalalow JH, ed. Frontiers in Queueing: Models and Applications in Science and Engineering (CRC Press, New York), 35–59.Google Scholar
• Grosof I, Scully Z, Harchol-Balter M (2018) SRPT for multiserver systems. Performance Evaluation 127–128:154–175.Google Scholar
• Guirguis S, Sharaf MA, Chrysanthis PK, Labrinidis A, Pruhs K (2009) Adaptive scheduling of web transactions. Ioannidis Y, Lee D, Ng R, eds. Data Engrg., 2009. ICDE’09. IEEE 25th Internat. Conf. (IEEE, Pisacataway, NJ), 357–368.Google Scholar
• Gupta V, Osogami T (2011) On Markov–Krein characterization of the mean waiting time in M/G/K and other queueing systems. Queueing Systems (68)3:339–352.Google Scholar
• Harchol-Balter M, Osogami T, Scheller-Wolf A, Wierman A (2005) Multi-server queueing systems with multiple priority classes. Queueing Systems 51(3):331–360.Google Scholar
• Harchol-Balter M, Schroeder B, Bansal N, Agrawal M (2003) Size-based scheduling to improve web performance. ACM Trans. Comput. Systems 21(2):207–233.Google Scholar
• Kingman JFC (1970) Inequalities in the theory of queues. J. Roy. Statist. Soc. Ser. B. Methodological 32(1):102–110.Google Scholar
• Montazeri B, Li Y, Alizadeh M, Ousterhout J (2018) Homa: A receiver-driven low-latency transport protocol using network priorities. Proc. 2018 Conf. ACM Special Interest Group Data Comm. (ACM, New York), 221–235.Google Scholar
• Schrage L (1968) Letter to the editor—A proof of the optimality of the shortest remaining processing time discipline. Oper. Res. 16(3):687–690.Link, Google Scholar
• Schrage LE, Miller LW (1966) The queue M/G/1 with the shortest remaining processing time discipline. Oper. Res. 14(4):670–684.Link, Google Scholar