Optimizing LLM Inference Throughput via Memory-aware and SLA-constrained Dynamic Batching
Not on the map. Why?
Abstract (arXiv)
The increasing adoption of large language models (LLMs) necessitates inference serving systems that can deliver both high throughput and low latency. Deploying LLMs with hundreds of billions of parameters on memory-constrained GPUs exposes significant limitations in static batching methods. Current inference serving systems often treat batch sizes as fixed hyper-parameters, hindering real-time adaptation to varying system conditions. In this paper, we propose a dynamic batching method that continuously monitors memory utilization and adheres to service-level agreements (SLAs) to enable real-time batch size configuration adjustment. The method comprises two core components: a memory-aware batch scheduler that dynamically allocates GPU resources and a latency feedback mechanism that optimizes decoding processes under SLA constraints. The numerical experiments demonstrate throughput gains of 8% to 28% and capacity improvements of 22% compared to traditional static batching methods, while maintaining full compatibility with existing inference infrastructure. These results highlight the effectiveness of dynamic batching in balancing computational efficiency and quality-of-service requirements for contemporary LLM deployment scenarios. The source code of this work is publicly available at https://github.com/KevinLee1110/dynamic-batching.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 7 Mar 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 5; 2026: 3.
8 papers.
- 2025Polar Sparsity: High Throughput Batched LLM Inferencing with Scalable Contextual Sparsitycited by 5
- 2025RAGDoll: Efficient Offloading-based Online RAG System on a Single GPUcited by 2
- 2025AGFT: An Adaptive GPU Frequency Tuner for Real-Time LLM Inference Optimizationcited by 2
- 2025Unlock the Potential of Fine-grained LLM Serving via Dynamic Module Scalingcited by 1
- 2025Streaming Tensor Programs: A Streaming Abstraction for Dynamic Parallelismcited by 0
- 2026Parallelization Strategies for Dense LLM Deployment: Navigating Through Application-Specific Tradeoffs and Bottleneckscited by 0
- 2026Requests of a Feather Must Flock Together: Batch Size vs. Prefix Homogeneity in LLM Inferencecited by 0
- 2026Geometry-Aware Online Scheduling for LLM Serving: From Theoretical Bound to System Practicecited by 0
- 2026Geometry-Aware Online Scheduling for LLM Serving: From Theoretical Bound to System Practice21 Jun 2026
- 2026Requests of a Feather Must Flock Together: Batch Size vs. Prefix Homogeneity in LLM Inference7 May 2026
- 2026Parallelization Strategies for Dense LLM Deployment: Navigating Through Application-Specific Tradeoffs and Bottlenecks5 Mar 2026
- 2025Streaming Tensor Programs: A Streaming Abstraction for Dynamic Parallelism11 Nov 2025
- 2025AGFT: An Adaptive GPU Frequency Tuner for Real-Time LLM Inference Optimization3 Aug 2025
- 2025Unlock the Potential of Fine-grained LLM Serving via Dynamic Module Scaling24 Jul 2025
- 2025Polar Sparsity: High Throughput Batched LLM Inferencing with Scalable Contextual Sparsity20 May 2025
- 2025RAGDoll: Efficient Offloading-based Online RAG System on a Single GPU17 Apr 2025