mlsanityData to 14 Oct 2026

Past-Future Scheduler for LLM Serving under SLA Guarantees

arXiv 2507.10150 ↗First posted 14 Jul 2025cs.DCcited by 20

On the map: Efficient LLM inference and serving → Serving systems and request scheduling

Abstract (arXiv)

The exploration and application of Large Language Models (LLMs) is thriving. To reduce deployment costs, continuous batching has become an essential feature in current service frameworks. The effectiveness of continuous batching relies on an accurate estimate of the memory requirements of requests. However, due to the diversity in request output lengths, existing frameworks tend to adopt aggressive or conservative schedulers, which often result in significant overestimation or underestimation of memory consumption. Consequently, they suffer from harmful request evictions or prolonged queuing times, failing to achieve satisfactory throughput under strict Service Level Agreement (SLA) guarantees (a.k.a. goodput), across various LLM application scenarios with differing input-output length distributions. To address this issue, we propose a novel Past-Future scheduler that precisely estimates the peak memory resources required by the running batch via considering the historical distribution of request output lengths and calculating memory occupancy at each future time point. It adapts to applications with all types of input-output length distributions, balancing the trade-off between request queuing and harmful evictions, thereby consistently achieving better goodput. Furthermore, to validate the effectiveness of the proposed scheduler, we developed a high-performance LLM serving framework, LightLLM, that implements the Past-Future scheduler. Compared to existing aggressive or conservative schedulers, LightLLM demonstrates superior goodput, achieving up to 2-3× higher goodput than other schedulers under heavy loads. LightLLM is open source to boost the research in such direction (https://github.com/ModelTC/lightllm).

Key facts. Cited by 20 papers in the map (data through 14 Oct 2026). Placed in Serving systems and request scheduling, one of 12 directions in Efficient LLM inference and serving. Builds on 18 of its 37 references that are in the map. First posted on arXiv 14 Jul 2025.

Builds on

18 of 37 references.

Closest ancestors · 2

Same direction, newest first

  1. 2024Mooncake: A KVCache-centric Disaggregated Architecture for LLM Serving24 Jun
  2. 2023FlashDecoding++: Faster Large Language Model Inference on GPUs2 Nov

Other references · 16

  1. 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
  2. 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
  3. 2023Improved Baselines with Visual Instruction Tuningcited by 4,418
  4. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  5. 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
  6. 2022Emergent Abilities of Large Language Modelscited by 2,512
  7. 2022BLOOM: A 176B-Parameter Open-Access Multilingual Language Modelcited by 1,984
  8. 2019Towards VQA Models That Can Readcited by 1,718
  9. 2017Get To The Point: Summarization with Pointer-Generator Networkscited by 1,292
  10. 2021GLM: General Language Model Pretraining with Autoregressive Blank Infillingcited by 1,031
  11. 2016Abstractive Text Summarization Using Sequence-to-Sequence RNNs and Beyondcited by 812
  12. 2023Baichuan 2: Open Large-scale Language Modelscited by 670
4 more
  1. 2023FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPUcited by 575
  2. 2017A Deep Reinforced Model for Abstractive Summarizationcited by 365
  3. 2024DeepSpeed-FastGen: High-throughput Text Generation for LLMs via MII and DeepSpeed-Inferencecited by 106
  4. 2023Outlier Suppression+: Accurate quantization of large language models by equivalent and optimal shifting and scalingcited by 61

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 4; 2026: 16.

20 papers.

Sort:

By area:

  1. 2026SenseNova-U1: Unifying Multimodal Understanding and Generation with NEO-unify Architecturecited by 32
  2. 2025TokenFlow: Responsive LLM Text Streaming Serving under Request Burst via Preemptive Schedulingcited by 10
  3. 2026ZipServ: Fast and Memory-Efficient LLM Inference with Hardware-Aware Lossless Compressioncited by 8
  4. 2025LLMC+: Benchmarking Vision-Language Model Compression with a Plug-and-play Toolkitcited by 7
  5. 2026A Survey on the Green Development of Large Models: From Resource-Efficient Architectures to Hardware-Software Co-Designcited by 5
  6. 2026Towards Resiliency in Large Language Model Serving with KevlarFlowcited by 3
  7. 2026FlowPrefill: Decoupling Preemption from Prefill Scheduling Granularity to Mitigate Head-of-Line Blocking in LLM Servingcited by 3
  8. 2025Astrolabe: Balancing Load in LLM Serving with Randomized Prediction-Guided Schedulingcited by 2
  9. 2025RepetitionCurse: Measuring and Understanding Router Imbalance in Mixture-of-Experts LLMs under DoS Stresscited by 2
  10. 2026SuperInfer: SLO-Aware Rotary Scheduling and Memory Management for LLM Inference on Superchipscited by 2
  11. 2026Paper Circle: An Open-source Multi-agent Research Discovery and Analysis Frameworkcited by 2
  12. 2026LatencyPrism: Online Non-intrusive Latency Sculpting for SLO-Guaranteed LLM Inferencecited by 1
8 more
  1. 2026PASCAL: A Phase-Aware Scheduling Algorithm for Serving Reasoning-based Large Language Modelscited by 1
  2. 2026Mind the Delay: Latency-aware Query Routing for Heterogeneous LLM poolscited by 1
  3. 2026SageSched: Efficient LLM Scheduling Confronting Demand Uncertainty and Hybriditycited by 0
  4. 2026ASAP: A Disaggregated and Asynchronous Inference System for MoE Prefillcited by 0
  5. 2026Beyond Prefill-Decode Disaggregation: Dissecting LLM Inference for Heterogeneous Platforms via Dynamic Operator Schedulingcited by 0
  6. 2026NELSSA: A GPU-PNM Heterogeneous System for Mixed-Length LLM Serving via Length-based Request Placementcited by 0
  7. 2026BALANCE: Hybrid Autoregressive-Speculative LLM Inference at the Network Edgecited by 0
  8. 2026TempoKV: Timely Staging of LLM KV Caches for Memory-Semantic Flashcited by 0

Similar, not cited

Close in wording, no citation either way

  1. 2025ProServe: Unified Multi-Priority Request Scheduling for LLM Serving
  2. 2026Beyond Binary Priorities: Multi-Tier SLA Scheduling for Large Language Model Serving
  3. 2026Cascade: Exploiting SLO-Aware latency budget for fair and high goodput LLM inference serving
  4. 2024Llumnix: Dynamic Scheduling for Large Language Model Serving
  5. 2026Taming Request Imbalance: SLO-Aware Scheduling for Disaggregated LLM Inference
  6. 2025Scorpio: Serving Right Requests at the Right Time for Heterogeneous SLOs in LLM Inference
  7. 2025LLM Serving Optimization with Variable Prefill and Decode Lengths
  8. 2024Queue management for slo-oriented large language model serving