A Universal Load Balancing Principle and Its Application to Large Language Model Serving
Not on the map. Why?
Abstract (arXiv)
Over 40% of computational power in Large Language Model (LLM) serving systems can be systematically wasted - not from hardware limits, but from load imbalance in barrier-synchronized parallel processing. When progress is gated by the slowest worker at each step, heterogeneous and evolving workloads create persistent stragglers; faster workers idle while drawing power, producing nothing. In large language model inference alone, this translates to gigawatt-hours of wasted electricity daily. Here we develop a universal load-balancing principle for barrier-synchronized systems with non-migratable state. We prove worst-case theoretical guarantees: imbalance reduction grows with system scale, and the resulting energy savings can exceed 52% for modern hardware at fleet scale. Experiments corroborate the theory, demonstrating 28% energy reduction alongside substantial throughput and latency improvements. Formulated as an online integer optimization with provable guarantees, the principle extends beyond LLM serving to broad classes of barrier-synchronized parallel systems, establishing a theoretical foundation for sustainable high-performance computing.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 25 Jan 2026.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026MoE-SpAc: Efficient MoE Inference Based on Speculative Activation Utility in Heterogeneous Edge Scenarioscited by 5
- 2026Analytical Provisioning for Attention-FFN Disaggregated LLM Serving under Stochastic Workloadscited by 2
- 2026A Queueing-Theoretic Framework for Stability Analysis of LLM Inference with KV Cache Memory Constraintscited by 2
- 2026Position: LLM Serving Needs Mathematical Optimization and Algorithmic Foundations, Not Just Heuristicscited by 1
- 2026Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scalecited by 0
- 2026End-to-End Latency-Minimizing and Load-Balanced Request Scheduling for Edge LLM Inference in Agentic AI Servicescited by 0
- 2026End-to-End Latency-Minimizing and Load-Balanced Request Scheduling for Edge LLM Inference in Agentic AI Services15 Sep 2026
- 2026Tackling the Data-Parallel Load Balancing Bottleneck in LLM Serving: Practical Online Routing at Scale7 May 2026
- 2026A Queueing-Theoretic Framework for Stability Analysis of LLM Inference with KV Cache Memory Constraints6 May 2026
- 2026Position: LLM Serving Needs Mathematical Optimization and Algorithmic Foundations, Not Just Heuristics2 May 2026
- 2026MoE-SpAc: Efficient MoE Inference Based on Speculative Activation Utility in Heterogeneous Edge Scenarios12 Feb 2026
- 2026Analytical Provisioning for Attention-FFN Disaggregated LLM Serving under Stochastic Workloads29 Jan 2026
Similar, not cited
Close in wording, no citation either way
- 2025Scaling Intelligence: Designing Data Centers for Next-Gen Language Models
- 2026Towards Multi-Model LLM Schedulers: Empirical Insights into Offloading and Preemption
- 2025EfficientLLM: Efficiency in Large Language Models
- 2025AsyncHZP: Hierarchical ZeRO Parallelism with Asynchronous Scheduling for Scalable LLM Training
- 2024NanoFlow: Towards Optimal Large Language Model Serving Throughput
- 2024Offline Energy-Optimal LLM Serving: Workload-Based Energy Models for LLM Inference on Heterogeneous Systems
- 2026The Economics of AI Decoding Chips: Rebalancing Compute, Capacity, and Bandwidth for Efficient LLM Inference
- 2025Accelerating Large Language Model Inference via Early-Exiting Algorithms