DynaSPLIT: Strong tail-optimal scheduling for the M/G/n with heavy-tailed job sizes
Zhouzi Li, Mor Harchol-Balter, Alan Scheller-Wolf
Abstract
We study the asymptotic response time tail in the M/G/n queue with heavy-tailed (regularly varying) job sizes. For this setting, strongly tail optimal policies are known only at lower load, where n-1 servers suffice for stability. At higher load, the tail optimal scheduling has been open. This paper presents DynaSPLIT, the first strongly tail optimal policy at high load. Together with prior work, this result shows that strong tail optimality is achievable across the entire stability region of the M/G/n with heavy-tailed job sizes.
Create a lesson
Related papers
How the Dirty Set Moves: Characterizing Schedule Reuse in Incremental Sparse Matrix Multiplication
Hunter Horne, Eric Spencer, Alex Henningfield et al.
PrismStencil: Transforming Stencil Computations into Matrix Multiplications
Xianmeng Jiang, Yuan Liang, Zixuan Wang et al.
Fast and Flexible Spiking Network Simulations on Massively Distributed On-Chip Memory Accelerators
Catherine Mia Schöfmann, Jan Finkbeiner, Jan Vogelsang et al.
How Reliable Are Large Language Models for Soil Organic Carbon Assessment? An Australian Benchmark
Yingxuan Cheng, Tong Li, Yayong Li et al.
AlignPred: Error-Controlled KV Cache Compression via Alignment and Predictive Coding
Xu Yang, Jiapeng Zhang, Zhiwei Zuo et al.
Compositional Performance Modeling of LLM Inference Clusters with Hierarchical KV Caching
Ruiyang Ma, Sheng Qi, DaiKang Kuang et al.