Abstract
The Gittins scheduling policy minimizes the mean response in the single-server M/G/1 queue in a wide variety of settings. Most famously, Gittins is optimal when preemption is allowed and service requirements are unknown but drawn from a known distribution. Gittins is also optimal much more generally, adapting to any amount of available information and any preemption restrictions. However, scheduling to minimize mean response time in a multiserver setting, specifically the central-queue M/G/k, is a much more difficult problem. In this work we give the first general analysis of Gittins in the M/G/k. Specifically, we show that under extremely general conditions, Gittins's mean response time in the M/G/k is at most its mean response time in the M/G/1 plus an $O(łog(1/(1 - ρ)))$ additive term, where ρ is the system load. A consequence of this result is that Gittins is heavy-traffic optimal in the M/G/k if the service requirement distribution S satisfies $\mathbfE [S^2(łog S)^+] < \infty$. This is the most general result on minimizing mean response time in the M/G/k to date. To prove our results, we combine properties of the Gittins policy and Palm calculus in a novel way. Notably, our technique overcomes the limitations of tagged job methods that were used in prior scheduling analyses.
- Samuli Aalto, Urtzi Ayesta, and Rhonda Righter. 2009. On the Gittins index in the M/G/1 queue. Queueing Systems 63, 1 (2009), 437--458. Google Scholar
Digital Library
- Samuli Aalto, Urtzi Ayesta, and Rhonda Righter. 2011. Properties of the Gittins index with application to optimal scheduling. Probability in the Engineering and Informational Sciences 25, 03 (2011), 269--288. Google Scholar
Digital Library
- Dimitris Bertsimas and José Niño-Mora. 1999. Optimization of Multiclass Queueing Networks with Changeover Times Via the Achievable Region Approach: Part II, The Multi-Station Case. Mathematics of Operations Research 24, 2 (1999), 331--361. Google Scholar
Cross Ref
- Onno J Boxma. 1989. Workloads and waiting times in single-server systems with multiple customer classes. Queueing Systems 5, 1--3 (1989), 185--214. Google Scholar
Digital Library
- Jhelum Chakravorty and Aditya Mahajan. 2014. Multi-armed bandits, Gittins index, and its calculation. Methods and applications of statistics in clinical trials: Planning, analysis, and inferential methods 2 (2014), 416--435.Google Scholar
- Ioana Dumitriu, Prasad Tetali, and Peter Winkler. 2003. On playing golf with two balls. SIAM Journal on Discrete Mathematics 16, 4 (2003), 604--615. Google Scholar
Digital Library
- John C. Gittins, Kevin D. Glazebrook, and Richard Weber. 2011. Multi-armed Bandit Allocation Indices. John Wiley & Sons.Google Scholar
- Kevin D Glazebrook. 2003. An analysis of Klimov's problem with parallel servers. Mathematical Methods of Operations Research 58, 1 (2003), 1--28.Google Scholar
Cross Ref
- Kevin D Glazebrook and José Niño-Mora. 2001. Parallel scheduling of multiclass M/M/m queues: Approximate and heavy-traffic optimization of achievable performance. Operations Research 49, 4 (2001), 609--623. Google Scholar
Digital Library
- Isaac Grosof, Ziv Scully, and Mor Harchol-Balter. 2018. SRPT for Multiserver Systems. Performance Evaluation 127--128 (2018), 154--175. Google Scholar
Digital Library
- Mor Harchol-Balter. 2013. Performance Modeling and Design of Computer Systems: Queueing Theory in Action (1st ed.). Cambridge University Press, New York, NY, USA. Google Scholar
Digital Library
- Leonard Kleinrock. 1976. Queueing Systems, Volume 2: Computer Applications. Vol. 66. Wiley New York. Proc. ACM Meas. Anal. Comput. Syst., Vol. 4, No. 3, Article 43. Publication date: December 2020. The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions 43:23 Google Scholar
Digital Library
- Minghong Lin, Adam Wierman, and Bert Zwart. 2010. The average response time in a heavy-traffic SRPT queue. In ACM SIGMETRICS Performance Evaluation Review, Vol. 38. ACM, 12--14. Google Scholar
Digital Library
- Paul Milgrom and Ilya Segal. 2002. Envelope Theorems for Arbitrary Choice Sets. Econometrica 70, 2 (2002), 583--601.Google Scholar
Cross Ref
- Michael Mitzenmacher. 2020. Scheduling with Predictions and the Price of Misprediction. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020) (Leibniz International Proceedings in Informatics (LIPIcs)), Thomas Vidick (Ed.), Vol. 151. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, 14:1--14:18.Google Scholar
- Masakiyo Miyazawa. 1994. Rate conservation laws: a survey. Queueing Systems 15, 1--4 (1994), 1--58.Google Scholar
Cross Ref
- Goran Peskir and Albert Shiryaev. 2006. Optimal Stopping and Free-Boundary Problems. Springer.Google Scholar
- Ziv Scully, Isaac Grosof, and Mor Harchol-Balter. 2020. Optimal Multiserver Scheduling with Unknown Job Sizes in Heavy Traffic. Performance Evaluation (2020). To appear. Google Scholar
Digital Library
- Ziv Scully, Mor Harchol-Balter, and Alan Scheller-Wolf. 2018. Optimal Scheduling and Exact Response Time Analysis for Multistage Jobs. (2018). arXiv:1805.06865Google Scholar
- Ziv Scully, Mor Harchol-Balter, and Alan Scheller-Wolf. 2018. SOAP: One Clean Analysis of All Age-Based Scheduling Policies. Proc. ACM Meas. Anal. Comput. Syst. 2, 1, Article 16 (April 2018), 30 pages. Google Scholar
Digital Library
- Albert Shiryaev. 2007. Optimal Stopping Rules. Vol. 8. Springer.Google Scholar
- Richard Weber. 1992. On the Gittins index for multiarmed bandits. The Annals of Applied Probability 2, 4 (1992), 1024--1033.Google Scholar
Cross Ref
- Peter Whittle. 1980. Multi-armed bandits and the Gittins index. Journal of the Royal Statistical Society. Series B (Methodological) (1980), 143--149.Google Scholar
- Ronald W. Wolff. 1982. Poisson arrivals see time averages. Operations Research 30, 2 (1982), 223--231. Google Scholar
Digital Library
Index Terms
The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions
Recommendations
The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions
SIGMETRICS '21The Gittins scheduling policy minimizes the mean response in the single-server M/G/1 queue in a wide variety of settings. Most famously, Gittins is optimal when preemption is allowed and service requirements are unknown but drawn from a known ...
The Gittins Policy is Nearly Optimal in the M/G/k under Extremely General Conditions
SIGMETRICS '21: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer SystemsThe Gittins scheduling policy minimizes the mean response in the single-server M/G/1 queue in a wide variety of settings. Most famously, Gittins is optimal when preemption is allowed and service requirements are unknown but drawn from a known ...
Modified vacation policy for M/G/1 retrial queue with balking and feedback
This paper studies a general retrial queue with balking and Bernoulli feedback, where the server operates a modified vacation policy. If the server is busy or on vacation, an arriving customer either enters an orbit with probability b, or balks (does ...






Comments