Skip to content
Preprint

Learning Agent Execution for KV-Cache Management in Agentic Serving

Jul 2026 · 5 citations · 49 references
Computer Science

TL;DR

CacheScout is presented, an agent-aware KV-cache runtime layer for multi-agent LLM serving that improves KV-cache hit rate, reduces mean TTFT, lowers mean per-turn latency, and increases peak throughput by up to 57%.

Abstract

Multi-agent LLM systems have emerged as an important deployment paradigm for AI services, where each user request is decomposed into a sequence of specialized agents. Across these workflows, every agent repeatedly executes a fixed context consisting of system prompts, tool definitions, and few-shot examples, creating substantial opportunities for KV-cache reuse. Existing LLM serving systems, however, manage KV-cache reactively using prefix caching and recency-based replacement, causing reusable agent contexts to be evicted before their next invocation and forcing repeated recomputation. We present CacheScout, an agent-aware KV-cache runtime layer for multi-agent LLM serving. The key insight is that future KV-cache reuse is governed by agent execution semantics rather than cache recency alone. CacheScout captures these semantics by learning agent execution transitions online, without requiring predefined workflow graphs or offline training, and uses the learned execution model to guide both cache eviction and proactive prefetching while leaving the serving critical path unchanged. We implement CacheScout on top of vLLM. Across representative real-world multi-agent workloads, CacheScout improves KV-cache hit rate by 10-18 percentage points, reduces mean TTFT by 18-45%, lowers mean per-turn latency by 29-38%, and increases peak throughput by up to 57%. These benefits also generalize to larger models, reducing TTFT by up to 54% while sustaining 37% higher throughput.

View source

Similar papers

#machine learning Preprint Sep 2026

KVCMAS: Efficient KV cache Correction for Shared Context in Multi-Agent Systems

KVCMAS is presented, an online KV cache correction framework that represents cross-agent cache deviations using compact low-rank states and seamlessly chains corrections along the agent workflow without an additional reference prefill, establishing KVCMAS as an accurate and scalable KV cache sharing approach for prompt...

Hyesung Jeon, Hyeongju Ha, Seoyoun Lee et al. · 0 citations
Preprint Aug 2026

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

A Task-Oriented Prefix-Aware Scheduler that jointly decides which agent prefixes to keep in the cache and which requests to schedule for execution and scores candidate post-decision states by trading off the expected reduction in each task's longest remaining service path against the near-term benefit of downstream pre...

Hongqiu Ni, Han Tian, Chi Zhang et al. · 3 citations
Preprint Sep 2026

RR-Evict: Fine-Grained Prefix Cache Eviction beyond LRU for Agentic LLM Serving

This work presents RR-EVICT, a fine-grained prefix-cache eviction strategy that distributes reclamation across idle agent trajectories, and implements RR-EVICT in SGLang and evaluates conversational and coding-agent workloads under colocated and prefill-decode-disaggregated serving.

Zai-Feng Pan, Chris Wu, Zheng-Ding Hu et al. · 0 citations
Preprint Sep 2026

Capture the lifecycle: KV Cache management in ReAct Agents with KVTether

Efficient serving of long-context reasoning-and-acting (ReAct) agents relies on KV cache reuse to reduce large language model (LLM) prefill latency and monetary cost. However, a semantic gap exists between agent harnesses and the underlying serving stack. Through context mutation, tool execution, and subagent coordinat...

Kai-Hua Fu, Yu-Kun Zhou, Chaokun Chang et al. · 0 citations
#machine learning Preprint Sep 2026

EfficientAgent: What Makes KV Cache Offloading Work for Concurrent Agents?

EfficientAgent is presented, which sizes and manages the host tier by this working set, which estimates the working set from agent histories to size the host tier and its predictions, made before the experiments, located the capacity at which offloading starts to pay.

Kun-Ming Shao, Jie-Run Chen, Jiang-Nan Yu et al. · 0 citations
Preprint Sep 2026

Tessera: Demand-Driven KV Cache Management for Retrieval-Augmented LLM Serving

RAG and retrieval-based agent memory both inject retrieved content into LLM prompts, as document chunks and recalled memory records, respectively. The same content can recur across requests at different prompt positions or after different preceding contexts, preventing reuse through conventional prefix caching. Our cha...

Fei Fang, Chung-Hsiang Lo, Yi Liu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.