arXiv CS
open access
When the KV Cache Is Slower Than the GPU: Scaling Remote KV Tiers for Context-Parallel Prefill
Reusing the attention KV cache across requests is a standard way to cut prefill cost in long-context LLM serving, and production systems increasingly back the per-engine cache with a remote tier shared by every engine. We study such a tier in a disaggregated deployment of GLM-5.3, an FP8 mixture-of-
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
- When the KV Cache Is Slower Than the GPU: Scaling Remote KV Tiers for Context-Parallel Prefill#1356836
- EStream: Fast and Memory-Efficient MoE Prefill through Expert Virtualization on Mobile NPUs#974665
- Optimizing ML Workload Partitioning between CPUs and CIM Accelerators for Heterogeneous Computing#343422
- P-PAS: Prefill-Pressure Adaptive Scheduling for Long-Context LLM Serving#612594
- P-PAS: Prefill-Pressure Adaptive Scheduling for Long-Context LLM Serving#611117
Record · ID 1348822
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