Open problems in queueing theory inspired by datacenter computing
Queueing Systems, vol. 97, no. 1, February 2021, pp. 3-37.
Carnegie Mellon University
Datacenter operations today provide a plethora of new queueing and scheduling problems. The notion of a “job” has becomemore general and multi-dimensional. Theways in which jobs and servers can interact have grown in complexity, involving parallelism, speedup functions, precedence constraints, and task graphs. The workloads are vastly more variable and more heavy-tailed. Even the performance metrics of interest are broader than in the past, with multi-dimensional service-level objectives in terms of tail probabilities. The purpose of this article is to expose queueing theorists to new models, while providing suggestions for many specific open problems of interest, as well as some insights into their potential solution.
FULL PAPER: pdf