cd /news/large-language-models/when-fancy-eviction-fails-rethinking… · home › topics › large-language-models › article
[ARTICLE · art-143508] src=arxiv.org ↗ pub= topic=large-language-models verified=true sentiment=· neutral

When Fancy Eviction Fails: Rethinking Cache Replacement for LLM Prefix Reuse

A September 24, 2026 arXiv paper studying production traces from two companies found that 14 eviction algorithms tested for LLM prefix caching deliver little benefit over LRU despite a large gap to Belady, because prefix reuse is dominated by the regular pacing of active sessions. The authors attribute the result to recency being unusually predictive under agentic workloads and introduce the compute-savings ratio plus two offline oracles to quantify heavy-tailed session footprints and variable miss costs. They recommend retaining recency as the foundation while selectively adding quick demotion for one-hit prefixes, compute-aware partial eviction for expensive misses, and capacity-dependent eviction granularity, and plan to release the traces and simulator.

read2 min views3 publishedOct 1, 2026
When Fancy Eviction Fails: Rethinking Cache Replacement for LLM Prefix Reuse
Image: source
  [Submitted on 24 Sep 2026]


[View PDF](https://arxiv.org/pdf/2609.28870)

[HTML (experimental)](https://arxiv.org/html/2609.28870v1)

Abstract:Long-running LLM applications repeatedly send growing context, making prefix caching critical for reducing prefill cost. Yet prefix-cache behavior under agentic workloads remains poorly understood. We study production traces from two companies and evaluate 14 eviction algorithms across HBM-constrained and large memory-pool settings. Despite a large gap to Belady, sophisticated policies designed for traditional caches provide little benefit over LRU. The reason is structural: prefix reuse is dominated by the regular pacing of active sessions, making recency unusually predictive. Prefix caching nevertheless introduces new challenges, including heavy-tailed session footprints and highly variable miss costs as attention computation grows with sequence length. We introduce the compute-savings ratio and two offline oracles to quantify these effects. Our results show that effective prefix-cache management should retain recency as its foundation while selectively adding quick demotion for one-hit prefixes, compute-aware partial eviction for expensive misses, and capacity-dependent eviction granularity. We will release the traces and simulator to support future research.

References & Citations

...

Bibliographic Explorer

(What is the Explorer?) Connected Papers

(What is Connected Papers?) Litmaps

(What is Litmaps?) scite Smart Citations

(What are Smart Citations?) alphaXiv

(What is alphaXiv?) CatalyzeX Code Finder for Papers

(What is CatalyzeX?) DagsHub

(What is DagsHub?) Gotit.pub

(What is GotitPub?) Hugging Face

(What is Huggingface?) ScienceCast

(What is ScienceCast?) Influence Flower

(What are Influence Flowers?) CORE Recommender

(What is CORE?) arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

── more in #large-language-models 4 stories · sorted by recency
── more on @arxiv 3 stories trending now
sponsored brought to you by zahid.host 4,200+ EU-deployed projects
reading about agents? ship yours in a single git push.

Run your AI side-project on zahid.host

EU-based hosting, git-push deploys, automatic HTTPS, no cold starts. Free tier with a custom domain — perfect for shipping the agent you just read about.

$git push zahid main
→ Live at https://your-agent.zahid.host ✓
Get free account → Pricing
from €0/mo · no card required
LIVE [news/when-fancy-eviction-…] indexed:0 read:2min 2026-10-01 · —