arXiv CS
open access
Range: Decoupling KV-Cache Reuse Granularity from Storage Work
LLM serving reuses cached key-value (KV) state to skip prefill, and growing contexts push that state past GPU HBM and CPU DRAM onto NVMe SSDs, placing prefix restore on the critical path of time-to-first-token (TTFT). We find that on a well-configured host-issued path the SSD is not the bottleneck:
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
- Range: Decoupling KV-Cache Reuse Granularity from Storage Work#1356577
- Building py-kvcache: A Performance Characterization of External KV Caching for vLLM with NVMe SSDs#999433
- Approximation Algorithms for Dual-Memory Request Scheduling in Disaggregated LLM Inference#1326829
- KV-Kaizen: Learning Context-Adaptive Cache Compression Choices#1144877
- KV-Kaizen: Learning Context-Adaptive Cache Compression Choices#1122339
Record · ID 1348928
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