When Does the Gittins Policy Have Asymptotically Optimal Response Time Tail?
Ziv Scully, Lucas van Kreveld
TL;DR
The paper analyzes the Gittins policy in the M/G/1 queue with unknown job sizes, focusing on the asymptotic tail of the response time $T$. By embedding Gittins in the SOAP framework, it derives a heavy-tailed tail-optimality condition and proves that Gittins is tail-optimal for nicely heavy-tailed job sizes; for light-tailed sizes, it classifies tail behavior by the worst-age point $a^*$ and demonstrates that small perturbations of Gittins can yield tail-optimal or intermediate performance while preserving near-optimal mean response time. The results reveal a dichotomy: in the heavy-tailed regime Gittins is always tail-optimal, while in the light-tailed regime its tail behavior can be optimal, pessimal, or intermediate depending on the distribution; a modest modification can eliminate pessimal tails. Collectively, the work provides a unified, policy-agnostic framework for diagnosing and improving tail performance of SOAP-based scheduling in M/G/1 with unknown job sizes, with implications for designing near-optimal schedulers that balance mean and tail performance in practice.
Abstract
We consider scheduling in the M/G/1 queue with unknown job sizes. It is known that the Gittins policy minimizes mean response time in this setting. However, the behavior of the tail of response time under Gittins is poorly understood, even in the large-response-time limit. Characterizing Gittins's asymptotic tail behavior is important because if Gittins has optimal tail asymptotics, then it simultaneously provides optimal mean response time and good tail performance. In this work, we give the first comprehensive account of Gittins's asymptotic tail behavior. For heavy-tailed job sizes, we find that Gittins always has asymptotically optimal tail. The story for light-tailed job sizes is less clear-cut: Gittins's tail can be optimal, pessimal, or in between. To remedy this, we show that a modification of Gittins avoids pessimal tail behavior while achieving near-optimal mean response time.
