arXiv Computation and Language

Pacing Branch Parallelism in LLM Serving

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.

arXiv Machine Learning
Oct 16

When the KV Cache Is Slower Than the GPU: Scaling Remote KV Tiers for Context-Parallel Prefill

The paper investigates the performance impact of using a remote KV cache tier for long‑context language model serving. In a disaggregated deployment of GLM‑5.3 on 8xB300 nodes, enabling the remote tier initially increased the 16k‑token p99 latency from 3.96 s to 17.3 s, and synchronous loading caused severe queue instability. By sharding the KV store across context‑parallel ranks, partitioning the remote tier, adding asynchronous loading, and fixing client bugs, the authors reduced the p99 latency from 83.32 s to 0.67 s and increased prefill throughput by 14–34 %. whyItMatters":"The study demonstrates that careful sharding and asynchronous handling of remote KV caches can dramatically improve latency and throughput in large‑scale LLM serving systems."

By Muhammad Ibrahim
arXiv AI
1d ago

VelServe: Taming Decode Jitters in LLM Inference with Tail-Calibrated Scheduling

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.

By Ishaan Datta, Alind Khare, Koushik Kumar Dey, Ratnesh Jamidar, Anand Kumar Singh
arXiv AI
Oct 31

Only Accepted Tokens Count: An Energy Accounting of Speculative Decoding Under Latency Targets

The paper investigates how speculative decoding—where a draft model proposes multiple future tokens that are then verified by the target model—affects energy consumption in large language model serving under latency constraints. It finds that energy savings depend heavily on the acceptance rate of drafted tokens, which varies by model architecture, drafting scheme, and the type of text (e.g., conversation vs. code, English vs. Romansh). The study shows that while speculation can reduce energy per token at small batch sizes, at larger batches the verification cost dominates, potentially turning speculation into an energy loss, especially when acceptance rates are low.

By Bole Ma, Ayesha Afzal, Jan Eitzinger, Harald Koestler, Gerhard Wellein
arXiv AI
Aug 20

Cacheable by Design? Training Mixture-of-Experts Routers for Locality Against the Edge Memory-Bandwidth Wall: A Pre-Registered Negative Result with a Systems Measurement Study

The paper investigates whether training Mixture-of-Experts (MoE) routers can improve memory‑bandwidth locality on consumer GPUs. Using a new zero‑surgery telemetry tool, the authors measure that a large Qwen3‑235B model is bottlenecked by disk‑based expert access, and that an LRU cache can serve a majority of requests. They pre‑register experiments training 137 M‑parameter MoE models with locality‑aware losses, finding that while cache misses can drop up to 60 % (99 % static‑pin hit rate), every configuration fails to meet a strict 1 % perplexity threshold, indicating a tight coupling between cache efficiency and model quality.

By Shriniwas Ramesh Suram