English

SageSched: Efficient LLM Scheduling Confronting Demand Uncertainty and Hybridity

Distributed, Parallel, and Cluster Computing 2026-03-16 v2

Abstract

Efficient LLM inference scheduling is crucial for user experience. However, LLM inferences exhibit remarkable demand uncertainty (with unknown output length beforehand) and hybridity (being both compute and memory intensive). Existing LLM schedulers rely on simple heuristics or focus purely on compute resource, suffering suboptimal performance. In this work, we propose SageSched, an efficient LLM scheduler that properly handles demand uncertainty and hybridity of inference workloads. SageSched combines prompt contents with the past inference results to predict output-length distribution in a light-weight and also accurate manner. Meanwhile, it models the true service cost of an inference request with both compute and memory aspects considered. Finally, SageSched employs an uncertainty-aware scheduling policy that can yield the best overall efficiency given the request cost distributions. Testbed experiments over diverse setups confirm that SageSched can attain an efficiency improvement of over 28.7%.

Keywords

Cite

@article{arxiv.2603.07917,
  title  = {SageSched: Efficient LLM Scheduling Confronting Demand Uncertainty and Hybridity},
  author = {Zhenghao Gan and Yichen Bao and Yifei Liu and Chen Chen and Quan Chen and Minyi Guo},
  journal= {arXiv preprint arXiv:2603.07917},
  year   = {2026}
}
R2 v1 2026-07-01T11:09:35.761Z