English

TokenDance: Scaling Multi-Agent LLM Serving via Collective KV Cache Sharing

Distributed, Parallel, and Cluster Computing 2026-04-06 v1

Abstract

Multi-agent LLM applications organize execution in synchronized rounds where a central scheduler gathers outputs from all agents and redistributes the combined context. This All-Gather communication pattern creates massive KV Cache redundancy, because every agent's prompt contains the same shared output blocks, yet existing reuse methods fail to exploit it efficiently. We present TokenDance, a system that scales the number of concurrent agents by exploiting the All-Gather pattern for collective KV Cache sharing. TokenDance's KV Collector performs KV Cache reuse over the full round in one collective step, so the cost of reusing a shared block is paid once regardless of agent count. Its Diff-Aware Storage encodes sibling caches as block-sparse diffs against a single master copy, achieving 11-17x compression on representative workloads. Evaluation on GenerativeAgents and AgentSociety shows that TokenDance supports up to 2.7x more concurrent agents than vLLM with prefix caching under SLO requirement, reduces per-agent KV Cache storage by up to 17.5x, and achieves up to 1.9x prefill speedup over per-request position-independent caching.

Keywords

Cite

@article{arxiv.2604.03143,
  title  = {TokenDance: Scaling Multi-Agent LLM Serving via Collective KV Cache Sharing},
  author = {Zhuohang Bian and Feiyang Wu and Chengrui Zhang and Hangcheng Dong and Yun Liang and Youwei Zhuo},
  journal= {arXiv preprint arXiv:2604.03143},
  year   = {2026}
}

Comments

14 pages, 14 figures, arXiv:submit/7438760 [cs.DC], preprint under review

R2 v1 2026-07-01T11:53:01.970Z