Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ajjkumar Patel

dblp:412/9471 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 67% Memory systems · 33%
Databases, data mining, and information retrieval
1 paper
Machine learning and data management · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
0.912025
KVFlow: Efficient Prefix Caching for Accelerating LLM-Based Multi-Agent Workflows · NeurIPS 2025
Memory systems › cache management
KV cache management
0.912025
KVFlow: Efficient Prefix Caching for Accelerating LLM-Based Multi-Agent Workflows · NeurIPS 2025
Cloud and datacenter computing › inference serving
LLM serving
0.912025
KVFlow: Efficient Prefix Caching for Accelerating LLM-Based Multi-Agent Workflows · NeurIPS 2025
Machine learning and data management
data management for machine learning
0.312025
KVFlow: Efficient Prefix Caching for Accelerating LLM-Based Multi-Agent Workflows · NeurIPS 2025

Methods — techniques the papers use, named apart from their topics

workflow-aware eviction · 1.7KV prefetching · 1.7
YearPublicationVenuePosition
2025 KVFlow: Efficient Prefix Caching for Accelerating LLM-Based Multi-Agent Workflows
abstract
Large language model (LLM) based agentic workflows have become a popular paradigm for coordinating multiple specialized agents to solve complex tasks. To improve serving efficiency, existing LLM systems employ prefix caching to reuse key-value (KV) tensors corresponding to agents' fixed prompts, thereby avoiding redundant computation across repeated invocations. However, current systems typically evict KV caches using a Least Recently Used (LRU) policy, which fails to anticipate future agent usage and often discards KV caches shortly before their reuse. This leads to frequent cache misses and substantial recomputation or swap- ping overhead. We present KVFlow, a workflow-aware KV cache management framework tailored for agentic workloads. KVFlow abstracts the agent execution schedule as an Agent Step Graph and assigns each agent a steps-to-execution value that estimates its temporal proximity to future activation. These values guide a fine-grained eviction policy at the KV node level, allowing KVFlow to preserve entries likely to be reused and efficiently manage shared prefixes in tree-structured caches. Moreover, KVFlow introduces a fully overlapped KV prefetching mecha- nism, which proactively loads required tensors from CPU to GPU in background threads for agents scheduled in the next step, thereby avoiding cache miss stalls during generation. Compared to SGLang with hierarchical radix cache, KVFlow achieves up to 1.83× speedup for single workflows with large prompts, and up to 2.19× speedup for scenarios with many concurrent workflows.
Zaifeng Pan, Ajjkumar Patel, Yipeng Shen, Zhengding Hu, Yue Guan 0003, Wan-Lu Li, Lianhui Qin, Yufei Ding 0001
NeurIPS2