mlsanityData to 14 Oct 2026

BATON: Enhancing Batch-wise Inference Efficiency for Large Language Models via Dynamic Re-batching

arXiv 2410.18701 ↗First posted 24 Oct 2024cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

The advanced capabilities of Large Language Models (LLMs) have inspired the development of various interactive web services or applications, such as ChatGPT, which offer query inference services for users. Unlike traditional DNN model, the inference of LLM entails different iterations of forward computation for different queries, which result in efficiency challenges for existing run-to-completion batch-wise inference. Hence, some methods refine batch-wise inference to iteration-level by duplicating all nonlinear layers of LLM. However, this approach not only increases resource usage but also introduces idle computations to the batch due to the prefilling of newly added queries. Therefore, we propose BATON, an efficient batch-wise LLM inference scheme by dynamically adjusting processing batch, which can achieve near-zero idle computations without incurring additional resource consumption. To do so, BATON 1) shapes the vectors involved in the inference of the newly inserted query and processing batch to align dimensions and generates a new attention mask based on vector shaping to ensure inference correctness, which enables query inserting without consuming additional resource; 2) embeds prefilled Keys and Values of the new query into the KV_Cache of the processing batch by leveraging the prefilling and decoding separation mechanism, eliminating idle computations to the batch introduced by the prefilling process of the new query. Experimental results show that compared to the state-of-the-art solution Orca, BATON improves query processing by up to 1.75 times.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 24 of its 44 references that are in the map. First posted on arXiv 24 Oct 2024.

Builds on

24 of 44 references.

References · 24

  1. 2017Attention Is All You Needcited by 60,361
  2. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2022Training language models to follow instructions with human feedbackcited by 15,971
  5. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  6. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 13,028
  7. 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,326
  8. 2022FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awarenesscited by 3,673
  9. 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,919
  10. 2024DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Servingcited by 617
  11. 2023Splitwise: Efficient generative LLM inference using phase splittingcited by 558
  12. 2024Taming Throughput-Latency Tradeoff in LLM Inference with Sarathi-Servecited by 526
12 more
  1. 2023SARATHI: Efficient LLM Inference by Piggybacking Decodes with Chunked Prefillscited by 193
  2. 2021Colossal-AI: A Unified Deep Learning System For Large-Scale Parallel Trainingcited by 96
  3. 2023Response Length Perception and Sequence Scheduling: An LLM-Empowered LLM Inference Pipelinecited by 86
  4. 2017TensorFlow-Serving: Flexible, High-Performance ML Servingcited by 85
  5. 2023Batch Prompting: Efficient Inference with Large Language Model APIscited by 85
  6. 2023S3: Increasing GPU Utilization during Generative Inference for Higher Throughputcited by 81
  7. 2023Full Stack Optimization of Transformer Inference: a Surveycited by 80
  8. 2020TurboTransformers: An Efficient GPU Serving System For Transformer Modelscited by 71
  9. 2024D'ej`aVu: KV-cache Streaming for Fast, Fault-tolerant Generative LLM Servingcited by 48
  10. 2023A Survey of Techniques for Optimizing Transformer Inferencecited by 35
  11. 2024DTLLM-VLT: Diverse Text Generation for Visual Language Tracking Based on LLMcited by 24
  12. 2023Understanding INT4 Quantization for Transformer Models: Latency Speedup, Composability, and Failure Casescited by 23

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.