arXiv (All)
open access
To Keep or Not to Keep: Learning KV Cache Retention in Disaggregated LLM Serving Systems
Disaggregated \textsc{LLM} serving separates prefill and decode across node pools, placing a network fabric between \textsc{KV}-cache computation and consumption. This breaks a key assumption of classical cache policies: a miss no longer incurs only local recomputation, but also network transfer to
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- PEEK: Predictive Queue-Informed KV Cache Management for LLM Serving#1070866
- Crossflow: Prefill-Decode Elasticity for Agentic LLM Serving#1063296
- LLM Serving Optimization with Variable Prefill and Decode Lengths#1141433
- Comparative Characterization of KV Cache Management Strategies for LLM Inference#1123063
- Fixed State, Long Reach: What a Constant-Size Cache Buys Block Diffusion at Scale#999980
Record · ID 1412878
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive