Cited by 75Topic ModelingNatural Language Processing TechniquesInformation Retrieval and Search Behavior

CacheBlend: Fast Large Language Model Serving for RAG with Cached Knowledge Fusion

Open access
Yao, Jiayi, Li, Hanchen, Liu, Yuhan, Ray, Siddhant, Cheng, Yihua, Zhang, Qizheng, Du, Kuntai, Lu, Shan +1 more·2025·Proceedings of the Twentieth European Conference on Computer Systems

Abstract

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

Crossref · 10.1145/3689031.3696098

Cites

14 of 14 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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”
  • 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.”
  • 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.”
  • 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.”
  • 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.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

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)
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
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