Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic
- 5 March 2021
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM SIGMETRICS Performance Evaluation Review
- Vol. 48 (3), 136-137
- https://doi.org/10.1145/3453953.3453984
Abstract
We consider scheduling to minimize mean response time of the M/G/k queue with unknown job sizes. In the singleserver k = 1 case, the optimal policy is the Gittins policy, but it is not known whether Gittins or any other policy is optimal in the multiserver case. Exactly analyzing the M/G/k under any scheduling policy is intractable, and Gittins is a particularly complicated policy that is hard to analyze even in the single-server case.Keywords
This publication has 3 references indexed in Scilit:
- SRPT for multiserver systemsPerformance Evaluation, 2018
- PROPERTIES OF THE GITTINS INDEX WITH APPLICATION TO OPTIMAL SCHEDULINGProbability in the Engineering and Informational Sciences, 2011
- On the Gittins index in the M/G/1 queueQueueing Systems, 2009