Oneiros: KV Cache Optimization through Parameter Remapping for Multi-tenant LLM Serving
Ruihao Li, Shagnik Pal, Vineeth Narayan Pullu, Prasoon Sinha, Jeeho Ryoo, Lizy K. John, Neeraja J. Yadwadkar

TL;DR
Oneiros introduces a parameter remapping technique to optimize KV cache management in multi-tenant LLM serving, significantly reducing latency and improving throughput by avoiding costly cache swapping.
Contribution
The paper presents a novel parameter remapping approach that eliminates KV cache swapping, enabling more efficient multi-tenant LLM inference on modern hardware.
Findings
Reduces tail latency by up to 82.5%.
Increases throughput by up to 86.7%.
Outperforms state-of-the-art solutions significantly.
Abstract
KV cache accelerates LLM inference by avoiding redundant computation, at the expense of memory. To support larger KV caches, prior work extends GPU memory with CPU memory via CPU-offloading. This involves swapping KV cache between GPU and CPU memory. However, because the cache updates dynamically, such swapping incurs high CPU memory traffic. We make a key observation that model parameters remain constant during runtime, unlike the dynamically updated KV cache. Building on this, we introduce Oneiros, which avoids KV cache swapping by remapping, and thereby repurposing, the memory allocated to model parameters for KV cache. This parameter remapping is especially beneficial in multi-tenant environments, where the memory used for the parameters of the inactive models can be more aggressively reclaimed. Exploiting the high CPU-GPU bandwidth offered by the modern hardware, such as the NVIDIA…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed and Parallel Computing Systems · Advanced Data Storage Technologies · Caching and Content Delivery
