arXiv (All)
open access
Building py-kvcache: A Performance Characterization of External KV Caching for vLLM with NVMe SSDs
Prefix caching can reduce the time to first token (TTFT) of long-context LLM requests by reusing previously computed key-value (KV) states, but for short prefixes or fast GPUs, recomputation can be faster than loading from an external cache. We characterize this tradeoff in vLLM across GPU, CPU, and
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
- Building py-kvcache: A Performance Characterization of External KV Caching for vLLM with NVMe SSDs#673467
- Same Request, Different Answer: Quantization Amplifies Cache-Induced Divergence in LLM Serving#971420
- KV-Kaizen: Learning Context-Adaptive Cache Compression Choices#1144877
- KV-Kaizen: Learning Context-Adaptive Cache Compression Choices#1122339
- Python in the front, party in the Backline: compiling quantum workloads across CPUs, GPUs, and FPGAs#673488
Record · ID 999433
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