CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion
Open accessAbstract
Large language models (LLMs) often incorporate multiple text chunks in their inputs to provide the necessary contexts. To speed up the prefill of the long LLM inputs, one can pre-compute the KV cache of a text and re-use the KV cache when the context is reused as the prefix of another LLM input. However, the reused text chunks are not always the input prefix, which makes precomputed KV caches not directly usable since they ignore the text's cross-attention with the preceding texts. Thus, the benefits of reusing KV caches remain largely unrealized.
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?
A PIC method first applies RoPE rotation to align cached Keys with the target positions in the new request, then computes key differences between the rotated cached values and freshly computed values to identify important positions.
“The key idea is to correct for positional encoding differences: a PIC method first applies RoPE rotation to align cached Keys with the target positions in the new request, then computes key differences between the rotated cached values and freshly computed values to identify important positions”
From TokenDance: Scaling Multi-Agent LLM Serving via Collective KV Cache Sharing (2026) · cites this paper as [35]
PIC recovers sharing beyond the prefix at the cost of additional compute for rotation and recomputation, and a minor accuracy trade-off at positions that are reused without recomputation.
“This recovers sharing beyond the prefix at the cost of additional compute for rotation and recomputation, and a minor accuracy trade-off at positions that are reused without recomputation.”
From TokenDance: Scaling Multi-Agent LLM Serving via Collective KV Cache Sharing (2026) · cites this paper as [35]
Position-independent caching (PIC) methods remove the positional constraint and can reuse blocks at arbitrary offsets, but they still process each request separately: in an N-agent round the same shared blocks trigger N separate reuse passes, paying per-request overhead.
“Positionindependent caching (PIC) methods [10, 34-36] remove this constraint and can reuse blocks at arbitrary offsets, but they still process each request separately: in an 𝑁 -agent round the same shared blocks trigger 𝑁 separate reuse passes, paying per-request overhead for what is fundamentally a roundlevel sharing opportunity.”
From TokenDance: Scaling Multi-Agent LLM Serving via Collective KV Cache Sharing (2026) · cites this paper as [35]
Position-independent caching (PIC) methods remove the positional constraint by recovering shared blocks at arbitrary offsets.
“Position-independent caching (PIC) methods [10, 34-36] remove this constraint by recovering shared blocks at arbitrary offsets.”
From TokenDance: Scaling Multi-Agent LLM Serving via Collective KV Cache Sharing (2026) · cites this paper as [35]
The current prototype uses CacheBlend's selective recomputation as the default backend, but any PIC method that accepts a set of token positions and returns corrected K/V tensors can serve as a drop-in replacement through an adapter interface.
“The current prototype uses CacheBlend [35]'s selective recomputation as the default backend, but any PIC method that accepts a set of token positions and returns corrected K/V tensors can serve as a drop-in replacement through an adapter interface.”
From TokenDance: Scaling Multi-Agent LLM Serving via Collective KV Cache Sharing (2026) · cites this paper as [35]
CacheBlend adds selective recomputation to restore accuracy at important positions.
“CacheBlend [35] further adds selective recomputation to restore accuracy at important positions.”
From TokenDance: Scaling Multi-Agent LLM Serving via Collective KV Cache Sharing (2026) · cites this paper as [35]
CacheBlend selectively recomputed boundary tokens and reduced TTFT by 2.2-3.3× while improving throughput by 2.8-5× with negligible quality loss.
“CacheBlend selectively recomputed boundary tokens and reduced TTFT by 2.2-3.3 × while improving throughput by 2.8-5 × with negligible quality loss [15].”
From Unified AI Gateway: A Framework for Joint Model Routing and KV Cache Management (2026) · cites this paper as [15]
Non-prefix segment reuse with positional and cross-segment interaction handling is required.
“non-prefix segment reuse with positional and cross-segment interaction handling [15], [16]”
From Unified AI Gateway: A Framework for Joint Model Routing and KV Cache Management (2026) · cites this paper as [15]
Multi-turn chat and RAG use representative hit rates for persistent dialogue and non-prefix document reuse.
“Multi-turn chat and retrieval-augmented generation (RAG) use representative hit rates for persistent dialogue and non-prefix document reuse [15], [62].”
From Unified AI Gateway: A Framework for Joint Model Routing and KV Cache Management (2026) · cites this paper as [15]
CacheBlend updates a reused KV cache, but it still feeds the KV cache to the same LLM that generated the KV cache, and it updates the KV cache of certain tokens rather than certain layers.
“For example, CacheBlend [97] updates a reused KV cache, but it still feeds the KV cache to the same LLMthat generated the KV cache. Moreover, it updates the KV cache of certain tokens, rather than certain layers like in DroidSpeak.”
From DroidSpeak: KV Cache Sharing for Cross-LLM Communication and Multi-LLM Serving (2024) · cites this paper as [97]
Advances in long-context LLMs and context-efficient inference such as KV cache reuse are making context-based approaches increasingly practical for deployment.
“Meanwhile, advances in long-context LLMs (Peng et al., 2024) and context-efficient inference such as KV cache reuse (Gim et al., 2024; Yao et al., 2025) are making context-based approaches increasingly practical for deployment.”
From Agentic Context Engineering: Evolving Contexts for Self-Improving Language Models (2025) · cites this paper as Yao et al., 2025
Cites
Billion-scale similarity search with GPUs
Johnson, J., Douze, M., & Jegou, H. (2021) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2019.2921572 · Cited by 4,228 · see citing works
Efficient Memory Management for Large Language Model Serving with PagedAttention
Kwon, W., Li, Z., Zhuang, S., Sheng, Y., Zheng, L., Yu, C. H., Gonzalez, J., Zhang, H., & Stoica, I. (2023) · Proceedings of the 29th Symposium on Operating Systems Principles · doi:10.1145/3600006.3613165 · Cited by 1,817 · see citing works
Efficient Memory Management for Large Language Model Serving with PagedAttention
Kwon, W., Li, Z., Zhuang, S., Sheng, Y., Zheng, L., Yu, C. H., Gonzalez, J. E., Zhang, H., & Stoica, I. (2023) · arXiv · doi:10.48550/arxiv.2309.06180 · Cited by 1,802 · see citing works
Mamba: Linear-Time Sequence Modeling with Selective State Spaces
Gu, A., & Dao, T. (2023) · arXiv · doi:10.48550/arxiv.2312.00752 · Cited by 1,579 · see citing works
Retrieval-Augmented Generation for Large Language Models: A Survey
Gao, Y., Xiong, Y., Gao, X., Jia, K., Pan, J., Bi, Y., Dai, Y., Sun, J., Wang, M., & Wang, H. (2023) · arXiv · doi:10.48550/arxiv.2312.10997 · Cited by 876 · see citing works
Rethinking Attention with Performers
Choromanski, K., Likhosherstov, V., Dohan, D., Song, X., Gane, A., Sarlos, T., Hawkins, P., Davis, J., Mohiuddin, A., Kaiser, L., et al. (2020) · arXiv · doi:10.48550/arxiv.2009.14794 · Cited by 695 · cited 1× · see citing works
“This can be intuitively explained by attention sparsity , a well-studied property observed in many transformer models by prior research [14, 15, 43, 58].”
In-Context Retrieval-Augmented Language Models
Ram, O., Levine, Y., Dalmedigos, I., Muhlgay, D., Shashua, A., Leyton-Brown, K., & Shoham, Y. (2023) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00605 · Cited by 449 · cited 1× · see citing works
“Retrieval augmented generation (RAG): RAG [22, 23, 37, 46, 48] can enhance the accuracy and reliability of LLMs with text chunks fetched from external sources.”
♫ MuSiQue: Multihop Questions via Single-hop Question Composition
Trivedi, H., Balasubramanian, N., Khot, T., & Sabharwal, A. (2022) · Transactions of the Association for Computational Linguistics · doi:10.1162/tacl_a_00475 · Cited by 283 · see citing works
LLMLingua: Compressing Prompts for Accelerated Inference of Large Language Models
Jiang, H., Wu, Q., Lin, C.-Y., Yang, Y., & Qiu, L. (2023) · arXiv · Cited by 168 · cited 2× · see citing works
“[19, 31, 32, 43, 55, 58] can complementary to CacheBlend.”
InfluentialGeneration-Augmented Retrieval for Open-Domain Question Answering
Mao, Y., He, P., Liu, X., Shen, Y., Gao, J., Han, J., & Chen, W. (2021) · Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers) · doi:10.18653/v1/2021.acl-long.316 · Cited by 146 · see citing works
LongLLMLingua: Accelerating and Enhancing LLMs in Long Context Scenarios via Prompt Compression
Jiang, H., Wu, Q., Luo, X., Li, D., Lin, C.-Y., Yang, Y., & Qiu, L. (2024) · Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers) · doi:10.18653/v1/2024.acl-long.91 · Cited by 96 · see citing works
LoongServe: Efficiently Serving Long-Context Large Language Models with Elastic Sequence Parallelism
Wu, B., Liu, S., Zhong, Y., Sun, P., Liu, X., & Jin, X. (2024) · Proceedings of the ACM SIGOPS 30th Symposium on Operating Systems Principles · doi:10.1145/3694715.3695948 · Cited by 62 · see citing works
Prompt Cache: Modular Attention Reuse for Low-Latency Inference
Gim, I., Chen, G., Lee, S.-S., Sarda, N., Khandelwal, A., & Zhong, L. (2023) · arXiv · doi:10.48550/arxiv.2311.04934 · Cited by 18 · cited 8× · see citing works
“KV cache reuse across requests: Storing and reusing KV cache across different requests have been commonly studied in recent work [24, 33, 41, 42, 59].”
InfluentialOptimizing LLM Queries in Relational Data Analytics Workloads
Liu, S., Biswal, A., Kamsetty, A., Cheng, A., Schroeder, L. G., Patel, L., Cao, S., Mo, X., Stoica, I., Gonzalez, J. E., et al. (2024) · arXiv · doi:10.48550/arxiv.2403.05821 · Cited by 8 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
RAGCache: Efficient Knowledge Caching for Retrieval-Augmented Generation
Jin, C., Zhang, Z., Jiang, X., Liu, F., Liu, X., Liu, X., & Jin, X. (2024) · arXiv · doi:10.48550/arxiv.2404.12457 · Cited by 61 · see citing works
RAGCache: Efficient Knowledge Caching for Retrieval-Augmented Generation
Jin, C., Zhang, Z., Jiang, X., Liu, F., Liu, S., Liu, X., & Jin, X. (2026) · ACM Transactions on Computer Systems · doi:10.1145/3768628 · Cited by 61 · see citing works
Agentic Context Engineering: Evolving Contexts for Self-Improving Language Models
Zhang, Q., Hu, C., Upasani, S., Ma, B., Hong, F., Kamanuru, V., Rainton, J., Wu, C., Ji, M., Li, H., et al. (2025) · arXiv · doi:10.48550/arxiv.2510.04618 · Cited by 3 · see citing works
Self-citationDroidSpeak: KV Cache Sharing for Cross-LLM Communication and Multi-LLM Serving
Liu, Y., Huang, Y., Yao, J., Feng, S., Gu, Z., Du, K., Li, H., Cheng, Y., Jiang, J., Lu, S., et al. (2024) · arXiv · doi:10.48550/arxiv.2411.02820 · Cited by 2 · see citing works
Self-citationUnified AI Gateway: A Framework for Joint Model Routing and KV Cache Management
Lu, J., Zhang, X., & Shao, Y. (2026) · arXiv · doi:10.48550/arxiv.2609.06940
SparseX: Efficient Segment-Level KV Cache Sharing for Interleaved LLM Serving
Zhang, Q., Chen, K., Liao, N., Lin, Z., Tang, B., Xiong, F., Li, Z., & Wang, X. (2026) · arXiv · doi:10.48550/arxiv.2606.01751
Self-citationDon't Break the Cache: An Evaluation of Prompt Caching for Long-Horizon Agentic Tasks
Lumer, E., Nizar, F., Jangiti, A., Frank, K., Gulati, A., Phadate, M., & Subbiah, V. K. (2026) · arXiv · doi:10.48550/arxiv.2601.06007
PEEK: Predictive Queue-Informed KV Cache Management for LLM Serving
Xie, B., Wang, Z., Tanaka, M., & Zheng, Z. (2026) · arXiv · doi:10.48550/arxiv.2607.02525
SmoothAgent: Efficient Long-Horizon LLM-Based Agent Serving with Lookahead Context Engineering
Pan, Z., Wang, Q., Hu, Z., Chen, C., Guan, Y., Zhou, Y., Swanson, S., & Ding, Y. (2026) · arXiv · doi:10.48550/arxiv.2607.00151
Agentic Plan Caching: Test-Time Memory for Fast and Cost-Efficient LLM Agents
Zhang, Q., Wornow, M., Wan, G., & Olukotun, K. (2025) · arXiv · doi:10.48550/arxiv.2506.14852
Self-citationTokenDance: Scaling Multi-Agent LLM Serving via Collective KV Cache Sharing
Bian, Z., Wu, F., Zhang, C., Dong, H., Liang, Y., & Zhuo, Y. (2026) · arXiv · doi:10.48550/arxiv.2604.03143
Continuum: Efficient and Robust Multi-Turn LLM Agent Scheduling with KV Cache Time-to-Live
Li, H., He, R., Mang, Q., Zhang, Q., Mao, H., Chen, X., Zhou, H., Zhang, H., Cheung, A., Gonzalez, J., et al. (2025) · arXiv · doi:10.48550/arxiv.2511.02230
Self-citation
- Authors
- Yao, J., Li, H., Liu, Y., Ray, S., Cheng, Y., Zhang, Q., Du, K., Lu, S., & Jiang, J.
- Affiliations
- University of Chicago (US)
- Stanford University (US)
- ORCID
- Venue
- Proceedings of the Twentieth European Conference on Computer Systems
- Publisher
- ACM
- Published
- 2025-03-30
- Pages
- 94-109
- OpenAlex
- W4408848702
- Cited by
- 75
- References
- 14
- Citations by year
- 2026: 55 · 2025: 20
- FWCI
- 71.22
- Type
- conference paper
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- Locations
- European Conference on Computer Systems (publishedVersion, cc-by)
- Funders
- University of Chicago
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Keywords
- large language model serving, retrieval-augmented generation, KV cache reuse, knowledge fusion, text chunking, cross-attention
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