Nov 2026· IEEE Transactions on Parallel and Distributed Systems· Vol 37, pp. 2605-2618· 0 citations· 45 references
Computer Science
TL;DR
Chat-Fusion is built, an efficient redundancy-free batch inference system that improves the throughput of popular LLMs by 1.4 times compared to other state-of-the-art inference systems, such as ORCA and vLLM.
Abstract
Batch processing is useful for optimizing the utilization of various hardware resources, such as GPUs, CPUs, and other specialized accelerators, and is also important for improving the throughput of LLM serving. Many research works have been conducted for better batching and scheduling policies for the efficiency of cloud LLM serving systems, enhancing data locality and resource utility. In our analysis of actual cloud LLM traces, we observed substantial computational and memory inefficiencies when handling batches of simultaneous user prompts. This inefficiency arises from padding and representation-equivalent tokens across prompts, which can lead to repeated or unnecessary operations. Existing LLM inference systems ignored such optimization opportunities offered by redundant tokens in the batch, resulting in a large amount of redundant computation and storage, especially the waste of KV cache memory, which severely limits the batch size and fails to fully utilize the potential of parallel computing in GPUs. To address these problems, we build Chat-Fusion, an efficient redundancy-free batch inference system. At the scheduling level, Chat-Fusion includes (1) a dynamic batching strategy that avoids padding and misalignment due to varied prompt length, (2) a runtime for clustering tokens into a repetition-free dense format and an indexing mechanism for prompt restoration, and (3) a compact KV-cache layout strategy that avoids fragmentation. At the execution level, since the inference process is changed by compression, we reimplemented the necessary transformer and KV-cache operations to realize high-efficiency, redundancy-free LLM computation on condensed input requests. Our evaluation shows that at the same latency, Chat-Fusion improves the throughput of popular LLMs by <inline-formula><tex-math notation="LaTeX">$1.1-3.4\times$</tex-math><alternatives><mml:math><mml:mrow><mml:mn>1</mml:mn><mml:mo>.</mml:mo><mml:mn>1</mml:mn><mml:mo>-</mml:mo><mml:mn>3</mml:mn><mml:mo>.</mml:mo><mml:mn>4</mml:mn><mml:mo>×</mml:mo></mml:mrow></mml:math><inline-graphic xlink:href="yu-ieq1-3734339.gif"/></alternatives></inline-formula> compared to other state-of-the-art inference systems, such as ORCA and vLLM.
Orthrus is a serving system that performs heterogeneous batching within a unified inference loop that addresses the primary challenge lies in unifying embedding and generation workloads with conflicting computational patterns while optimizing batch composition for high performance.
Dohyun Park, Hubertus Franke, Daniel G. Waddington et al.· Proceedings of the 2026 Conf...· 1 citation
Large language model (LLM) inference, the process by which a pre-trained model receives an input prompt and generates output tokens sequentially, has become increasingly important with the widespread deployment of LLM-based applications. As inference workloads continue to scale, GPU memory has emerged as a critical bot...
Large language models (LLMs) deliver impressive performance across diverse natural language processing tasks, but their intensive computation and memory requirements severely restrict real-world deployment, especially on edge devices and in latency-sensitive cloud services. Static inference pipelines execute full layer...
Yu-Chien Liao, Zi-Jian Zeng· WSEAS Transactions on Comput...· 0 citations
This paper designs ACDC, a task-aware offline serving system that leverages inherent determinism and throughput orientation and designs a hybrid-serving mechanism that harvests these bubbles for offline tasks, improving end-to-end throughput by up to 35.7% over the state-of-the-art alternative.
Le-Ping Yang, Xue Li, Kun Qian et al.· Proceedings of the ACM SIGOP...· 0 citations
Large language model serving is increasingly limited not only by model size and GPU speed, but also by scheduling during autoregressive decoding, where continuous batching interleaves requests at token granularity as sequences arrive and finish. We study whether lightweight scheduling policies can improve latency-throu...