DOPD: A Dynamic PD-Disaggregation Architecture for Maximizing Goodput in LLM Inference Serving
Not on the map. Why?
Abstract (arXiv)
To meet strict Service-Level Objectives (SLOs),contemporary Large Language Models (LLMs) decouple the prefill and decoding stages and place them on separate GPUs to mitigate the distinct bottlenecks inherent to each phase. However, the heterogeneity of LLM workloads causes producerconsumer imbalance between the two instance types in such disaggregated architecture. To address this problem, we propose DOPD (Dynamic Optimal Prefill/Decoding), a dynamic LLM inference system that adjusts instance allocations to achieve an optimal prefill-to-decoding (P/D) ratio based on real-time load monitoring. Combined with an appropriate request-scheduling policy, DOPD effectively resolves imbalances between prefill and decoding instances and mitigates resource allocation mismatches due to mixed-length requests under high concurrency. Experimental evaluations show that, compared with vLLM and DistServe (representative aggregation-based and disaggregationbased approaches), DOPD improves overall system goodput by up to 1.5X, decreases P90 time-to-first-token (TTFT) by up to 67.5%, and decreases P90 time-per-output-token (TPOT) by up to 22.8%. Furthermore, our dynamic P/D adjustment technique performs proactive reconfiguration based on historical load, achieving over 99% SLOs attainment while using less additional resources.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). First posted on arXiv 26 Nov 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026SLO-Aware Compute Resource Allocation for Prefill-Decode Disaggregated LLM Inferencecited by 1
- 2026Salca: A Sparsity-Aware Hardware Accelerator for Efficient Long-Context Attention Decodingcited by 0
- 2026PEARL: Adaptive Prefill-Decode Execution with Elasticity for Agentic Reinforcement Learningcited by 0
- 2026DScale: Scaling Block-Diffusion Speculative Decoding with Adaptive Verificationcited by 0
- 2026FluidPD: In-Place Elasticity for SLO-Aware Prefill-Decode Disaggregated LLM Servingcited by 0
- 2026Prorsa: Unleashing the Potential of Prefill-Decode Disaggregation in Agentic Reinforcement Learningcited by 0
- 2026Prorsa: Unleashing the Potential of Prefill-Decode Disaggregation in Agentic Reinforcement Learning12 Oct 2026
- 2026FluidPD: In-Place Elasticity for SLO-Aware Prefill-Decode Disaggregated LLM Serving2 Oct 2026
- 2026DScale: Scaling Block-Diffusion Speculative Decoding with Adaptive Verification29 Sep 2026
- 2026PEARL: Adaptive Prefill-Decode Execution with Elasticity for Agentic Reinforcement Learning28 Sep 2026
- 2026Salca: A Sparsity-Aware Hardware Accelerator for Efficient Long-Context Attention Decoding27 Apr 2026
- 2026SLO-Aware Compute Resource Allocation for Prefill-Decode Disaggregated LLM Inference5 Mar 2026
Similar, not cited
Close in wording, no citation either way
- 2025Arrow: Adaptive Scheduling Mechanisms for Disaggregated LLM Inference Architecture
- 2026Beyond Prefill-Decode Disaggregation: Dissecting LLM Inference for Heterogeneous Platforms via Dynamic Operator Scheduling
- 2025Optimal Scheduling Algorithms for LLM Inference: Theory and Practice
- 2026PDD: Unleashing Economical and Flexible Heterogeneous LLM Inference via Cross-Datacenter Prefill-Decode Disaggregation
- 2025DynaServe: Unified and Elastic Execution for Dynamic Disaggregated LLM Serving
- 2026Taming Request Imbalance: SLO-Aware Scheduling for Disaggregated LLM Inference
- 2024Llumnix: Dynamic Scheduling for Large Language Model Serving
- 2024DistServe: Disaggregating Prefill and Decoding for Goodput-optimized Large Language Model Serving