Nexus主动调度大模型推理中的预填充与解码,提升吞吐量2.2倍
Nexus:Proactive Intra-GPU Disaggregation of Prefill and Decode in LLM Serving
- 动态分配GPU资源,按需划分计算与内存以减少冲突
- 在多种模型和负载下实现最高2.2倍吞吐量、20倍更短首字延迟
- 适合高并发大模型服务场景,尤其对动态负载响应更强
单体式服务通过分块预填充提高GPU利用率,但存在细粒度阶段干扰。引擎级预填充-解码(PD)分离避免干扰,却带来更高硬件与协调开销。现有同GPU内分离方法在单个GPU内复用预填充与解码,依赖基于SLO的调优,由离线分析或反应式反馈驱动。然而这些方法仅在问题发生后响应,难以适应动态负载。我们提出:能否实现能主动应对动态负载的同GPU内分离?关键挑战在于管理预填充与解码在不同条件下的资源冲突。我们首先发现GPU资源存在收益递减——超过饱和点后增加分配几乎不降低延迟;其次观察到内存带宽竞争成为关键瓶颈。这些洞察促使我们设计一种动态划分机制,联合考虑计算能力、内存占用与带宽竞争。在多种LLM与工作负载上评估,Nexus系统达到最高2.2倍吞吐量,首令牌时间(TTFT)降低20倍,总比特时间(TBT)降低2.5倍,优于vLLM;相比SGLang提升最高2倍;性能与分离式vLLM相当或更优。
原文摘要 · Abstract (English)
Monolithic serving with chunked prefill improves GPU utilization by batching prefill and decode together, but suffers from fine-grained phase interference. Engine-level prefill-decode (PD) disaggregation avoids interference but incurs higher hardware and coordination overhead. Prior intra-GPU disaggregation approaches multiplex prefill and decode within a single GPU, using SLO-based tuning guided by heuristics from offline profiling or reactive feedback loops. However, these methods respond reactively to performance issues rather than anticipating them, limiting adaptability under dynamic workloads. We ask: can we achieve proactive intra-GPU disaggregation that adapts effectively to dynamic workloads? The key challenge lies in managing the conflicting resource demands of prefill and decode under varying conditions. We first show that GPU resources exhibit diminishing returns -- beyond a saturation point, more allocation yields minimal latency benefit. Second, we observe that memory bandwidth contention becomes a critical bottleneck. These insights motivate a design that dynamically partitions GPU resources across prefill and decode phases, while jointly considering compute capacity, memory footprint, and bandwidth contention. Evaluated on diverse LLMs and workloads, our system Nexus achieves up to 2.2x higher throughput, 20x lower TTFT, and 2.5x lower TBT than vLLM; outperforms SGLang by up to 2x; and matches or exceeds disaggregated vLLM.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。