paperbot · PL 论文追踪

全部论文 待读 收藏

P2 Accelerating LLM Serving for Multi-turn Dialogues with Efficient Resource Management

以高效资源管理加速多轮对话的 LLM 服务
ASPLOS Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 22025匹配度 2/10 · 该论文属于 LLM 推理服务系统优化(多级 KV cache、请求重排序),目标是提升 LLM 服务本身的吞吐与延迟,而非将静态分析应用于 ML/Agentic 程序或反向用 LLM 改进分析,也不涉及浮点程序分析或贝叶斯程序分析。虽然标签含“机器学习与程序语言”,但只是运行时/内存管理的工程优化,与研究画像的核心问题基本不相交。引用 30 inbox
Jinwoo Jeong, Jeongseob Ahn
crossref: 2026-09-12dblp: 2026-09-12

AI 速览

一句话:提出 FlashGen,用多级 KV cache 与请求重排序消除多轮对话中的 KV 重算和队头阻塞,大幅提升 LLM 服务吞吐。

论文指出现有 LLM 服务框架在处理用户与助手多轮对话时存在两点不足:一是必须为理解多轮上下文而重复计算注意力的 key/value(KV),带来可观的算力开销;二是随着轮次累积提示变长,先来先服务(FCFS)调度常引发队头阻塞,使 GPU 资源利用不足。为此作者提出 FlashGen,构建由 GPU、CPU、SSD 组成的多级 KV cache,保留历史轮次的注意力 KV,并通过低成本缓存恢复技术替代重计算;同时提出请求重排序调度,在不损害公平性的前提下调整请求执行顺序以更好利用 GPU 显存。在 ShareGPT 数据集上,对 OPT 30B 与 Llama-2 70B,FlashGen 在延迟相近的前提下相比 vLLM 分别取得 1.63 倍与 2.85 倍的吞吐提升。

问题
多轮对话场景下,现有 LLM 服务框架需反复重算历史上下文的注意力 KV,且提示随轮次增长使 FCFS 调度产生队头阻塞,导致 GPU 计算与显存资源利用不足。
方法
提出 FlashGen:以 GPU/CPU/SSD 多级 KV cache 保留历史轮次注意力 KV,用低成本缓存恢复替代重计算;并提出不牺牲公平性的请求重排序调度以提升 GPU 显存利用率。
评估
在 ShareGPT 数据集上,对 OPT 30B 与 Llama-2 70B 与 vLLM 对比,在相近延迟边界下吞吐分别提升 1.63 倍与 2.85 倍。
原文摘要(Abstract)

Although there have been significant efforts to make LLM serving efficient, we observe two limitations of current state-of-the-art serving frameworks in handling multi-turn dialogues between users and assistants, particularly in chat scenarios. First, existing LLM frameworks incur substantial computational overhead in recomputing attention keys and values (KVs) for understanding context across multiple turns of user queries. Second, as the prompt length of user queries is amplified due to multi-turns, a first-come-first-served (FCFS) scheduling policy often causes head-of-line blocking issues, leading to underutilization of GPU resources. To address these limitations, we present FlashGen to rapidly complete multi-turn queries by efficiently utilizing the compute and memory resources of GPUs as well as the host hardware (e.g., DRAM and SSD). We introduce a multi-level KV cache comprised of GPU, CPU, and SSD, to efficiently retain attention KVs from prior turns. Our approach employs low-cost cache restoration techniques to avoid the recomputation burden. Further, we propose a request reordering technique to effectively utilize GPU memory. This scheduling technique carefully adjusts the request order without compromising fairness. Our proposed techniques outperform the vLLM framework in terms of both latency and throughput. For OPT 30B and Llama-2 70B models with the ShareGPT dataset, we achieve 1.63x and 2.85x better throughput, respectively while in a similar latency boundary.

链接与引用

DOI 原文 · PDF(开放获取) · DBLP

BibTeX
@inproceedings{JeongA25,
  title = {Accelerating LLM Serving for Multi-turn Dialogues with Efficient Resource Management},
  author = {Jinwoo Jeong and Jeongseob Ahn},
  booktitle = {ASPLOS},
  year = {2025},
  doi = {10.1145/3676641.3716245}
}