Skip to content
Preprint

CacheRoute: Planned Prefix-Affinity Routing for Large-Scale LLM Serving

Aug 2026 · 1 citation · 14 references
Computer Science

TL;DR

When affinity recovers too little KV work, its residual load skew reduces or erases the improvement, so gating any deployment with a shadow replay rather than enabling affinity from workload statistics alone is recommended.

Abstract

Prefix caching avoids prefill only when a repeated request returns to a server that still holds the prefix KV. Cache-blind balancing disperses that reuse; fixed affinity preserves it but can overload a server. CacheRoute resolves this tradeoff with a periodic routing plan. It admits high-rate keys to a stable warm set and places their assignments by expected load. Hot keys may use more than one destination, although every key in our primary semi-synthetic aggregate uses exactly one. On Llama-3.3-70B in fp8 across 60 H100 GPUs, CacheRoute sustains 176+/-11 QPS at a 3.5-s p99 SLO, 2.3x the strongest of five baselines. Served KV-cache hit rate rises from 64.1+/-1.3% under cache-blind balancing to 93.2+/-0.5%. A second semi-synthetic aggregate and controlled 8B and burst experiments separate the effects of affinity and placement. Two 32B workloads provide the counterexamples: when affinity recovers too little KV work, its residual load skew reduces or erases the improvement. We therefore recommend gating any deployment with a shadow replay rather than enabling affinity from workload statistics alone.

View source

Similar papers

Preprint Aug 2026

Preserving Admission Responsibility in Multi-Tenant Large Language Model Prefix Caches

Results show that object-value signals rank what to retain, while persistent responsibility determines which group bears reclamation pressure, which shows that object-value signals rank what to retain, while persistent responsibility determines which group bears reclamation pressure.

Zhi-Yu Wang, Rajkummar Buyya · 2 citations
Preprint Aug 2026

Which Eviction Policy Should an LLM Cache Use? A Systematic Study Across Workloads, Capacities, and Encoders

The cross-encoder study shows that thresholds do not transfer between embedding models, and LFU is the strongest simple default in this protocol; deployment decisions should first establish answer validity and then test sub-point policy differences with exact search.

Y. Kulkarni, Shubham Harkare, A. Babu · 0 citations
Conference Jul 2026

A Survey on Caching Systems in Serverless Computing

Serverless computing, particularly Function-as-aService (FaaS), has emerged as a dominant cloud computing paradigm offering automatic scaling, pay-per-use pricing, and simplified deployment. However, the stateless and ephemeral nature of serverless functions introduces significant performance challenges, most notably c...

Donghyeon Kim, Sangoh Park · 0 citations
Sep 2026

Co-Optimizing Request Scheduling and KV Caching for Edge LLM Serving

Deploying large language models (LLMs) on edge nodes enables low-latency and privacy-preserving inference, but faces severe resource constraints under high-concurrence workloads. While existing inference systems leverage intranode key–value (KV) caching to improve efficiency, they largely neglect the unique complexitie...

Xishuo Li, Wei Jiao, Jun He et al. · 0 citations
Conference Aug 2026

Poster: AutoThermKV: An Efficient User-Transparent In-Memory Management of Hot Data for Key-Value Stores

Log-structured merge-tree (LSM-tree) key-value stores rely on caching to mitigate multi-component lookups and long tails, yet block and KP caches are prone to compactioninduced expiry, and all three cache types suffer from scan pollution under LRU eviction. We present AutoThermKV, a two-level in-memory architecture tha...

Yunfan Chi, E. Sha, Longshan Xu et al. · 0 citations
Preprint Jul 2026

General Non-Clairvoyant KV-Cache Scheduling via Regime-Aware Routing

This work presents the first constant-competitive algorithm for arbitrary prompt lengths and arbitrary response lengths with no additional assumptions, built on a novel regime-aware routing framework.

Yiding Feng, Siyu Liu, Zonghan Yang et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.