Disaggregated inference is modeled as three games whose price of anarchy rises at GPU saturation; an adaptive controller reduces the empirical PoA-hat by up to 3.1x on real clusters at modest throughput cost.
Prefill-Decode Aggregation or Disaggregation? Uni- fying Both for Goodput-Optimized LLM Serving.arXiv preprint arXiv:2508.01989, 2025a
3 Pith papers cite this work. Polarity classification is still indexing.
verdicts
UNVERDICTED 3representative citing papers
A load-aware prefill deflection scheduler for disaggregated LLM serving reduces P95 TTFT by up to 81% by interleaving chunked prefill on decode nodes and eliminating KV-cache transfers.
Layered prefill replaces token-chunked prefill with layer-group interleaving in MoE models, cutting TTFT by up to 70%, end-to-end latency by 41%, and per-token energy by 22% while preserving stall-free TBT.
citing papers explorer
-
The Price of Anarchy in Disaggregated Inference
Disaggregated inference is modeled as three games whose price of anarchy rises at GPU saturation; an adaptive controller reduces the empirical PoA-hat by up to 3.1x on real clusters at modest throughput cost.
-
Towards Load-Aware Prefill Deflection for Disaggregated LLM Serving
A load-aware prefill deflection scheduler for disaggregated LLM serving reduces P95 TTFT by up to 81% by interleaving chunked prefill on decode nodes and eliminating KV-cache transfers.
-
From Tokens to Layers: Redefining Stall-Free Scheduling for MoE Serving with Layered Prefill
Layered prefill replaces token-chunked prefill with layer-group interleaving in MoE models, cutting TTFT by up to 70%, end-to-end latency by 41%, and per-token energy by 22% while preserving stall-free TBT.