arXiv:2504.09590cs.AI2025-04被引 3

让实时与批量请求共用资源,显著降低响应延迟。

Efficient LLM Serving on Hybrid Real-time and Best-effort Requests

  • 动态优先级调度+双向键值缓存,实现两类请求混合部署。
  • 实时请求延迟最高降低74.20%,批量请求吞吐几乎不变。
  • 适合需要兼顾低延迟与高吞吐的AI服务场景。

大型语言模型(LLMs)在单个模型上支持多种生成任务。现实世界的服务(如 OpenAI ChatGPT)常需同时处理对延迟敏感的实时请求(如问答系统,简称 RT)和追求吞吐的后台请求(如文档批量处理,简称 BE),形成复杂的混合推理负载。当前先进系统将机器专用于不同类型请求,分别优化低延迟或高吞吐,虽简化管理但资源利用率低。本文提出 BROS 系统,旨在将 RT/BE 请求共置,满足实时请求的延迟要求并保持批量请求的吞吐。BROS 通过动态优先级算法解决混合调度问题,并设计双向键值缓存机制,使实时请求可共享键值内存,打破因内存不足导致的调度限制,提升资源利用率。大量实验表明,BROS 在混合请求下表现优异:实时请求延迟最高降低 74.20%,其细粒度服务等级目标(SLO)达成率提升达 36.38 倍,而批量请求吞吐损失可忽略,显著优于 vLLM 与 TGI 等 SOTA 系统。

原文摘要 · Abstract (English)

Recent breakthroughs in large Language Models (LLMs) have enabled various generative tasks on a single model. Real-world services (e.g., OpenAI's ChatGPT [27]) powered by an LLM often concurrently support latency-critical requests for interactive applications (e.g., question-answering systems, referred to as real-time or RT requests) and throughput-oriented requests for back-of-house processing (e.g., documents batch processing [28], referred to best-effort or BE requests), with complex hybrid inference workloads to the underlying model. State-of-the-art (SOTA) LLM serving systems dedicate machines to each type of request, towards either low inference latency or high serving throughput, respectively. This practice simplifies request scheduling and management but suffers from poor resource utilization. We propose BROS, a hybrid LLM serving system that aims to collocate RT/BE requests, meeting RT requests' latency requirements while maintaining BE requests' throughput. BROS formulates the problem of hybrid RT/BE request scheduling and solves it with a dynamic priority-based algorithm. BROS designs a bidirectional KV cache management mechanism, allowing RT requests to share KV memory with BE requests to remove the scheduling restrictions caused by insufficient KV memory and improve utilization. Extensive experiments validate that BROS achieves a good trade-off when serving hybrid RT and BE requests. It significantly reduces the latency of RT requests (up to 74.20%), improving their fine-grained service level objectives (SLOs) attainments (up to 36.38x), with negligible throughput reduction for BE requests, showing significant advantages over SOTA systems like vLLM and TGI.

LLM服务混合请求延迟优化资源利用

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。