CacheGen: KV Cache Compression and Streaming for Fast Large Language Model Serving
Open accessAbstract
As large language models (LLMs) take on complex tasks, their inputs are supplemented with longer contexts that incorporate domain knowledge. Yet using long contexts is challenging as nothing can be generated until the whole context is processed by the LLM. While the context-processing delay can be reduced by reusing the KV cache of a context across different inputs, fetching the KV cache, which contains large tensors, over the network can cause high extra network delays.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Limited GPU memory capacity poses a significant challenge for caching large-scale prefixes.
“Insufficient GPU Memory: While GPUs excel in computation, their limited memory capacity poses a significant challenge for caching large-scale prefixes [13,48].”
From HotPrefix: Hotness-Aware KV Cache Scheduling for Efficient Prefix Sharing in LLM Inference Systems (2025) · cites this paper as [13]
SwiftCache, KVServe, CacheGen, and TraCT showed that reload, bandwidth-aware compression, streaming, and shared memory must be considered together.
“SwiftCache, KVServe, CacheGen, and TraCT showed that reload, bandwidth-aware compression, streaming, and shared memory must be considered together [27], [32], [76], [79].”
From Unified AI Gateway: A Framework for Joint Model Routing and KV Cache Management (2026) · cites this paper as [27]
Complementary techniques compress or stream the cache, persist it across multi-turn conversations, share it across enterprise deployments, or evict it adaptively under memory pressure; these are orthogonal to where the cache should physically live in a multi-cloud fleet.
“Complementary techniques compress or stream the cache [39], persist it across multi-turn conversations [40], share it across enterprise deployments [59], or evict it adaptively under memory pressure [41, 42]; these are orthogonal to where the cache should physically live in a multi-cloud fleet.”
From Janus: Joint Prefill/Decode Disaggregation with KV-Cache-Aware Multi-Cloud Routing for Edge-Adjacent LLM Serving (2026) · cites this paper as [39]
HCache, InfiniGen, CacheGen, MoonCake, and CachedAttention reduce the cost of long-context serving through recomputation, offloading, compression, or disaggregation.
“HCache [5], InfiniGen [13], CacheGen [19], MoonCake [30], and CachedAttention [4] reduce the cost of long-context serving through recomputation, offloading, compression, or disaggregation.”
From TokenDance: Scaling Multi-Agent LLM Serving via Collective KV Cache Sharing (2026) · cites this paper as [19]
The compression and transfer manager makes reusable KV caches deliverable under heterogeneous edge bandwidth and storage constraints.
“The compression and transfer manager makes reusable KV caches deliverable under heterogeneous edge bandwidth and storage constraints [27].”
From Unified AI Gateway: A Framework for Joint Model Routing and KV Cache Management (2026) · cites this paper as [27]
Context caching relies on KV caches that are model-dependent and not easily transferable across different models.
“These KV caches are inherently model-dependent and not easily transferable across different models [56, 33]”
From Agentic Plan Caching: Test-Time Memory for Fast and Cost-Efficient LLM Agents (2025) · cites this paper as [34]
DroidSpeak differs from prior work in why and how to re-compute KV cache: it is designed for KV cache reuse across different LLMs, while prior work assumes a single LLM; none of the prior work chooses to re-compute or re-use a group of layers like DroidSpeak.
“DroidSpeak differs with prior work [31,32,61,97] in why and how to re-compute KVcache: DroidSpeak is designed for KV cache reuse across different LLMs, while prior work assumes a single LLM; due to the different purposes, none of the prior work chooses to re-compute or re-use a group of layers like in DroidSpeak.”
From DroidSpeak: KV Cache Sharing for Cross-LLM Communication and Multi-LLM Serving (2024) · cites this paper as [61]
CacheGen [39] compresses and streams the cache; InfiniGen [41] and H2O [42] evict adaptively for long contexts.
“CacheGen [39] compresses and streams the cache; InfiniGen [41] and H2O [42] evict adaptively for long contexts.”
From Janus: Joint Prefill/Decode Disaggregation with KV-Cache-Aware Multi-Cloud Routing for Edge-Adjacent LLM Serving (2026) · cites this paper as [39]
No citation lists for this paper
No citation lists for this paper yet — checked again daily.
References 38 · Cited by 118
- Authors
- Liu, Y., Li, H., Cheng, Y., Ray, S., Huang, Y., Zhang, Q., Du, K., Yao, J., Lu, S., Ananthanarayanan, G., Maire, M., Hoffmann, H., Holtzman, A., & Jiang, J.
- Affiliations
- University of Chicago (US)
- Stanford University (US)
- Chinese University of Hong Kong, Shenzhen (CN)
- Microsoft (United States) (US)
- ORCID
- Venue
- Proceedings of the ACM SIGCOMM 2024 Conference
- Publisher
- ACM
- Published
- 2024-08-04
- Pages
- 38-56
- OpenAlex
- W4401176373
- Cited by
- 118
- References
- 38
- Citations by year
- 2026: 70 · 2025: 47 · 2024: 1
- FWCI
- 34.82
- Type
- conference paper
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- ACM SIGCOMM Conference (SIGCOMM) (publishedVersion, cc-by)
- Knowledge@UChicago (University of Chicago) (submittedVersion, cc-by-nc-nd)
- University of Chicago (cc-by)
- Funders
- NSF (CNS-2146496, CNS-2131826, CNS-2313190, CNS-1901466, CNS-1956180, CCF-2119184)
- UChicago CERES Center
- MARIN and Stuart Rice Research Award
- Chameleon Projects
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
- Keywords
- KV cache compression, large language model serving, long-context modeling, network latency reduction, tensor compression, inference acceleration
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review