mlsanityData to 7 Oct 2026

Enabling Efficient Batch Serving for LMaaS via Generation Length Prediction

arXiv 2406.04785 ↗First posted 7 Jun 2024cs.DCcited by 20

Not on the map. Why?

Abstract (arXiv)

Nowadays, large language models (LLMs) are published as a service and can be accessed by various applications via APIs, also known as language-model-as-a-service (LMaaS). Without knowing the generation length of requests, existing serving systems serve requests in a first-come, first-served (FCFS) manner with a fixed batch size, which leads to two problems that affect batch serving efficiency. First, the generation lengths of requests in a batch vary, and requests with short generation lengths must wait for requests with long generation lengths to finish during the batch serving procedure. Second, requests with longer generation lengths consume more memory during serving. Without knowing the generation lengths of batched requests, the batch size is always set small to avoid the out-of-memory (OOM) error, thus preventing the GPU from being fully utilized. In this paper, we find that a significant number of popular applications in the LMaaS scenario have a positive correlation between the generation length and the length of raw user input. Based on this observation, we propose Magnus, which can accurately predict the request generation length with the user input length, application-level, and user-level semantic features. Accordingly, Magnus can achieve high request throughput by batching requests of similar generation lengths together with adaptive batch sizes. Besides, Magnus can also schedule batches with the highest response ratio next (HRRN) policy to reduce request response time. Experiments conducted on our testbed show that Magnus improves request throughput by up to 234% and reduces response time by up to 89.7% compared to baselines.

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Jun 2024.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 6; 2025: 8; 2026: 6.

20 papers.

Sort:

By area:

  1. 2024Efficient LLM Scheduling by Learning to Rankcited by 83
  2. 2025OmniRouter: Budget and Performance Controllable Multi-LLM Routingcited by 35
  3. 2024Don't Stop Me Now: Embedding Based Scheduling for LLMscited by 34
  4. 2025Seer: Online Context Learning for Fast Synchronous LLM Reinforcement Learningcited by 21
  5. 2025Online Scheduling for LLM Inference with KV Cache Constraintscited by 17
  6. 2025Taming the Titans: A Survey of Efficient LLM Inference Servingcited by 16
  7. 2024Fast Inference for Augmented Large Language Modelscited by 10
  8. 2024Multi-Bin Batching for Increasing LLM Inference Throughputcited by 9
  9. 2026Task-Aware LLM Routing with Multi-Level Task-Profile-Guided Data Synthesis for Cold-Start Scenarioscited by 8
  10. 2025Scorpio: Serving Right Requests at the Right Time for Heterogeneous SLOs in LLM Inferencecited by 6
  11. 2024Revisiting Service Level Objectives and System Level Metrics in Large Language Model Servingcited by 5
  12. 2025Arrow: Adaptive Scheduling Mechanisms for Disaggregated LLM Inference Architecturecited by 5
8 more
  1. 2025Queueing, Predictions, and LLMs: Challenges and Open Problemscited by 4
  2. 2026Chimera: Latency- and Performance-Aware Multi-agent Serving for Heterogeneous LLMscited by 4
  3. 2026Robust Length Prediction: A Perspective from Heavy-Tailed Prompt-Conditioned Distributionscited by 3
  4. 2025Equinox: Holistic Fair Scheduling in Serving Large Language Modelscited by 2
  5. 2024Software Performance Engineering for Foundation Model-Powered Softwarecited by 0
  6. 2026Duration Aware Scheduling for ASR Serving Under Workload Driftcited by 0
  7. 2026Geometry-Aware Online Scheduling for LLM Serving: From Theoretical Bound to System Practicecited by 0
  8. 2026MAPS: Memory-Aware Predictive Scheduling Framework for Large Language Model Servingcited by 0