RadixFlow: Filling Execution Bubbles in Prefix-Cached Hybrid LLM Serving
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
The Flow has not summarised this story yet — read it at arXiv AI.
arXiv:2607. 02525v1 Announce Type: cross Abstract: We present PEEK, a lightweight scheduling and eviction framework for both online (streaming) and offline (batch) LLM serving; this paper focuses on the online regime.
The paper investigates how prefix caching in large language model (LLM) agents can lead to persistent degradation when small bursts of additional requests occur. Even with identical base workloads, a brief surge can push a vLLM server into a degraded state—reducing hit ratios, throughput, and causing a backlog that grows for over an hour—while a server without the burst remains healthy. The study identifies that slower service keeps more sessions active, expanding the working set beyond the key‑value pool and triggering repeated recomputations, and demonstrates that simple mitigation strategies such as admission throttling, session suspension, and a budgeter that limits resident KV demand can prevent or recover from this collapse.
VelServe is a scheduler designed to reduce decode jitters in large language model (LLM) inference, ensuring that latency service-level objectives (SLOs) for time to first token (TTFT) and time between tokens (TBT) are met. It calibrates the amount of prefill work each decode step performs based on the measured tail latency of that step, leaving headroom to prevent overruns and prioritizing shorter waiting prompts. Experiments on multiple attention families and workloads show that VelServe improves SLO goodput by 2.4–2.9× over the best baseline on Qwen3‑8B and DeepSeek‑V4‑Flash, and by at least 4.4× on DeepSeek‑V2‑Lite, while meeting SLOs for more than twice as many requests when prefill and decode are disaggregated across eight GPUs.
The paper investigates how prefix caching in LLM agent serving can lead to persistent degradation when traffic bursts occur. It shows that even a small increase in arrivals can push a vLLM server into a low hit‑ratio, low‑throughput regime that continues to deteriorate for an extended period, while a server without prefix caching remains stable. The authors identify a workload‑balance condition that predicts this collapse and evaluate mitigation strategies such as throttling, session suspension, and a KV‑budgeting approach, finding the latter most effective.
arXiv:2609.37626v1 Announce Type: cross Abstract: No single way of parallelizing attention serves large language models well under all loads. Low concurrency favors tensor parallelism, many independe...
The paper introduces PACE, a per‑step admission controller that manages intra‑request parallelism in large language model serving. By admitting extra decoding branches only when the predicted branch externality fits within the batch’s current slack, PACE avoids the pitfalls of eager or fixed‑cap branch admission. Experiments on Qwen3‑32B and other large models show that PACE boosts goodput by up to 2.15× while maintaining 99% SLO attainment.