ShuffleInfer: Disaggregate LLM Inference for Mixed Downstream Workloads

Transformer-based large language model (LLM) inference serving is now the backbone of many cloud services. LLM inference consists of a prefill phase and a decode phase. However, existing LLM deployment practices often overlook the distinct characteristics of these phases, leading to significant interference. To mitigate interference, our insight is to carefully schedule and group inference requests based on their characteristics. We realize this idea in ShuffleInfer through three pillars. First, it partitions prompts into fixed-size chunks so that the accelerator always runs close to its computation-saturated limit. Second, it disaggregates prefill and decode instances so each can run independently. Finally, it uses a smart two-level scheduling algorithm augmented with predicted resource usage to avoid decode scheduling hotspots. Results show that ShuffleInfer improves time-to-first-token (TTFT), job completion time (JCT), and inference efficiency in terms of performance per dollar by a large margin, e.g., it uses 38% less resources all the while lowering average TTFT and average JCT by 97% and 47%, respectively.

Authors

Institutions

Publication Details

Journal
ACM Transactions on Architecture and Code Optimization
Published
2025-04-30
DOI
https://doi.org/10.1145/3732941
Citations
11
Primary Topic
Parallel Computing and Optimization Techniques
Type
article
Field-Weighted Citation Impact
24.96
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

ShuffleInfer: Disaggregate LLM Inference for Mixed Downstream Workloads

Sa Wang, Yizhou Shan, C.-C. Hu, Shuang Chen et al.
11 citations
ACM Transactions on Architecture and Code Optimization
Parallel Computing and Optimization Techniques
24.96
article

ShuffleInfer: Disaggregate LLM Inference for Mixed Downstream Workloads

Sa Wang, Yizhou Shan, C.-C. Hu, Shuang Chen, Chenxi Wang, Xu Jiang, Xusheng Chen, Ninghui Sun, Liangliang Xu, Yungang Bao, Haoyang Huang, Hao Feng
article en
11 citations

Abstract

Transformer-based large language model (LLM) inference serving is now the backbone of many cloud services. LLM inference consists of a prefill phase and a decode phase. However, existing LLM deployment practices often overlook the distinct characteristics of these phases, leading to significant interference. To mitigate interference, our insight is to carefully schedule and group inference requests based on their characteristics. We realize this idea in ShuffleInfer through three pillars. First, it partitions prompts into fixed-size chunks so that the accelerator always runs close to its computation-saturated limit. Second, it disaggregates prefill and decode instances so each can run independently. Finally, it uses a smart two-level scheduling algorithm augmented with predicted resource usage to avoid decode scheduling hotspots. Results show that ShuffleInfer improves time-to-first-token (TTFT), job completion time (JCT), and inference efficiency in terms of performance per dollar by a large margin, e.g., it uses 38% less resources all the while lowering average TTFT and average JCT by 97% and 47%, respectively.

ACM Transactions on Architecture and Code OptimizationVol. 22(2)
Xidian University (CN), Chinese Academy of Sciences (CN), Huawei Technologies (China) (CN), Institute of Computing Technology (CN), State Key Laboratory of Computer Architecture
Openalex Percentile: Top 0%
Parallel Computing and Optimization Techniques
24.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.