Sharp Waiting-Time Bounds for Multiserver Jobs

Abstract

Multiserver jobs, which are jobs that occupy multiple servers simultaneously during service, are prevalent in today’s computing clusters. But, little is known about the delay performance of systems with multiserver jobs. We consider queueing models for multiserver jobs in scaling regimes where the system load becomes heavy and meanwhile, the total number of servers in the system and the number of servers that a job needs become large. Prior work has derived upper bounds on the queueing probability in this scaling regime. However, without proper lower bounds, the existing results cannot be used to differentiate between policies. In this paper, we study the delay performance by establishing sharp bounds on the steady-state mean waiting time of multiserver jobs, where the waiting time of a job is the time spent in queueing rather than in service. We first characterize the exact order of the mean waiting time under the first come, first serve (FCFS) policy. Then, we prove a lower bound on the mean waiting time of all policies, which has an order gap with the mean waiting time under FCFS. We show that the lower bound is achievable by a priority policy that we call smallest need first (SNF).Funding: This research was supported in part by the National Science Foundation [Grant ECCS-2145713].Supplemental Material: The online appendix is available at https://doi.org/10.1287/stsy.2023.0006 .