paper-with-me

Papers

TokenLake: A Unified Segment-level Prefix Cache Pool for Fine-grained Elastic Long-Context LLM Serving

2025-08-24 · Bingyang Wu, Zili Zhang, Yinmin Zhong, Guanzhe Huang, Yibo Zhu, Xuanzhe Liu, Xin Jin arxiv

Prefix caching is crucial to accelerate multi-turn interactions and requests with shared prefixes. At the cluster level, existing prefix caching systems are tightly coupled with request scheduling to optimize cache efficiency and computation performance together, leading to load imbalance, data redundancy, and memory fragmentation of caching systems across instances. To address these issues, memory pooling is promising to shield the scheduler from the underlying cache management so that it can focus on the computation optimization. However, because existing prefix caching systems only transfer increasingly longer prefix caches between instances, they cannot achieve low-latency memory pooling. To address these problems, we propose a unified segment-level prefix cache pool, TokenLake. It uses a declarative cache interface to expose requests' query tensors, prefix caches, and cache-aware operations to TokenLake for efficient pooling. Powered by this abstraction, TokenLake can manage prefix cache at the segment level with a heavy-hitter-aware load balancing algorithm to achieve better cache load balance, deduplication, and defragmentation. TokenLake also transparently minimizes the communication volume of query tensors and new caches. Based on TokenLake, the scheduler can schedule requests elastically by using existing techniques without considering prefix cache management. Evaluations on real-world workloads show that TokenLake can improve throughput by up to 2.6$\times$ and 2.0$\times$ and boost hit rate by 2.0$\times$ and 2.1$\times$, compared to state-of-the-art cache-aware routing and cache-centric PD-disaggregation solutions, respectively.

📄 PDF Abstract BibTeX arXiv:2508.17219

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

PRISM: Fast Online LLM Serving via Scheduling-Memory Co-design

2026-05-09 · Xingyu Qu, Tianhao Lin, Yiqi Li, Zhiyu Chen 외 arxiv

Modern online large language model (LLM) services, such as Retrieval-Augmented Generation (RAG) and agent systems, increasingly expose two prominent characteristics: prompt segmentation (e.g., system instructions, retrie…

Models Take Notes at Prefill: KV Cache Can Be Editable and Composable

2026-06-14 · Bojie Li arxiv

Prefix caching reuses prefill only across an exactly shared prefix, so one changed field invalidates the entire downstream cache. Yet overwriting the field's own key/value vectors and reusing the rest leaves the model ac…

TOPAS: Workflow-Aware Prefix-State Scheduling for Multi-Agent LLM Serving

2026-08-26 · Hongqiu Ni, Han Tian, Chi Zhang, Guopeng Li 외 arxiv

Prefix caching introduces a fundamental tradeoff in multi-agent large language model (LLM) serving: retaining a long system-prompt key-value (KV) cache for an agent accelerates future calls, yet it reduces the GPU memory…

Towards Distributed Inference of LLMs on a P2P Network

2026-05-07 · Shabari S Nair, Krishanu Saini arxiv

Prefix caching can reduce LLM inference latency by reusing KV caches across requests with shared prompts, but cluster-scale reuse is challenging because caches are partitioned across nodes. We propose a decentralized, pr…

Tail-Replay: Escaping the Curse of Linear Attention in Prefix Caching for Hybrid LLMs

2026-08-31 · Yirui Liu, Ruoling Qi, Xuaner Wu, Penghang Liu 외 arxiv

Hybrid large language models interleave full-attention layers with linear-attention layers to reduce the cost of long-context inference. This structure complicates prefix caching: full-attention key-value caches are toke…