2026/05/20 by Heyuan Yao, Willow Kowalik, Izzy Grosof · 1 voice
Business, Management and Accounting · Computer Science · #Advanced Queuing Theory Analysis #Cloud Computing and Resource Management #Discretization #Distributed and Parallel Computing Systems #Granularity #Job scheduler #Process (computing) #Queueing theory #Resource (disambiguation) #Scheduling (production processes) #Stability (learning theory) #cs.PF
paper · pdf · open access · doi:10.48550/arxiv.2605.21715
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2026/05/20 · arxiv published 2026/05/20 · arxiv updated 2026/05/20 · openalex created_date 2026/05/23 · openalex updated_date 2026/07/28
Modern computing systems process jobs with resource requirements such as CPU and memory, which are described by multiresource jobs (MRJ) queueing models. In practice, job resource requirements are spread out over so many values, that it is rare to see the same value twice. This pattern is best modeled by a continuous distribution of requirement values. However, the existing theoretical work on stability or throughput-optimality focuses on queueing models with class-based resource requirements. In class-based models, the number of distinct resource requirements must be small to demonstrate strong empirical performance, making them a poor match for these practical systems. We introduce the first throughput-optimal family of scheduling policies for the continuous MRJ model, with both preemptive and nonpreemptive variants. We further introduce several efficient policy families, which remain throughput-optimal while considerably improving computational efficiency, under some distributional assumptions. We use a discretization approach, where we choose the discretization granularity based on the system load and the distribution of resource requirements. We validate the real-world applicability of our policies by comparing them against existing index-based policies on parametrized distributions and on datacenter trace data from the Google Borg scheduler, demonstrating state-of-the-art performance.