CoAgent: Concurrency Control for Multi-Agent Systems

• URL: http://arxiv.org/abs/2606.15376v1
• Date: Sat, 13 Jun 2026 16:15:14 GMT
• Title: CoAgent: Concurrency Control for Multi-Agent Systems
• Abstract summary: This paper builds control on a capability classical transactions lack.<n>It fixes a serialization order at launch, serves each read the order-filtered value, and applies writes speculatively in place.<n>It grows a 25-tool library online and lifts the task pass rate from 45/71 to 63/71 at $0.80times$ the time and $0.86times$ the cost.
• Score: 3.127039011380953
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-agent LLM systems -- coding agents, devops agents, document agents -- now routinely run several agents in parallel against the same git tree, Kubernetes cluster, or document. As soon as two of them mutate shared state, they enter the regime classical concurrency control has studied for decades, but classical mechanisms fit LLM agents poorly. A single agent transaction spans minutes of inference, read sets are broad and opaque rather than statically inferable, and the live state agents act on admits neither fork nor buffer, so writes take effect the moment they execute. Locks block long inference intervals; OCC abort-and-retry discards minutes of work on every conflict. This paper builds concurrency control on a capability classical transactions lack: the LLM inside each agent can judge whether a conflicting write invalidates its plan, and can repair exactly the operations that depended on it. Control therefore turns advisory: the runtime informs, the agent repairs. Our protocol, MTPO (Monotonic Trajectory Pre-Order), fixes a serialization order at launch, serves each read the order-filtered value, and applies writes speculatively in place; a one-way notification asks an affected reader to re-judge and patch its plan, while the framework mechanically undoes and reorders misplaced writes through the saga-style inverse each tool registers in advance. At quiescence the run is serializable in the pre-decided order. We realize MTPO as CoAgent, toolcall middleware whose privileged ToolSmith grows footprint-declared, undoable tools online. On ten contended workloads, CoAgent stays within 5\% of serial correctness at a $1.4\times$ speedup and near-serial token cost, where 2PL and OCC surrender nearly all concurrency gains; on a bash-only target system, it grows a 25-tool library online and lifts the task pass rate from 45/71 to 63/71 at $0.80\times$ the time and $0.86\times$ the cost.

Related papers

• Codebook Agent: Amortized Topology Design for LLM Multi-Agent Systems [67.04448659688579]
  We develop a query-independent 16-entry codebook that ranks the top decoded candidates in a single batched forward pass.<n>With no iterative search and no message passing at test time, Codebook Agent is the most accurate method on all six benchmarks.
  arXiv  Detail & Related papers  (2026-09-02T08:10:22Z)
• AgentRoom: Concurrent Multi-Agent Coding in a CRDT-Backed Shared Workspace [2.650689617442372]
  AgentRoom is a realtime collaborative editing protocol for concurrent coding agents.<n>It exposes file-level claim, status, and broadcast as MCP tools on a CRDT-merged layer.<n>For CLI-stable models, AgentRoom with 2 agents abandons fewer tasks than Solo and has less run-to-run variation.
  arXiv  Detail & Related papers  (2026-08-24T18:28:33Z)
• Training Small LLMs as Spatial Multi-Agent Policies [17.254137262162505]
  We take up both threads in spatial cooperative games, where small frozen LLMs prompt with low-level actions fail outright, earning zero reward.<n>We equip each game with a library of symbolic emphoptions: typed, state-feasible, short-horizon behaviors executed by a symbolic planner.<n>Each agent's LLM acts as its policy over options, with a private per-agent LoRA adapter trained by a per-agent variant of multi-agent GRPO.
  arXiv  Detail & Related papers  (2026-08-02T18:14:40Z)
• What Should Agents Say? Action-state Communication for Efficient Multi-Agent Systems [27.11156309236441]
  We analyze five common inter-agent communication strategies across two multi-agent systems.<n>We propose the PACT (Protocolized Action-state Communication and Transmission), which treats inter-agent communication as a public state-update problem.<n>We show that PACT consistently improves the performance-cost trade-off, achieving comparable or stronger task performance with substantially fewer tokens.
  arXiv  Detail & Related papers  (2026-06-03T18:00:22Z)
• Multi-Agent Computer Use [72.79887808312706]
  We argue that we should move towards evaluating and building multi-agent computer use (MACU) systems.<n>We propose a general multi-agent setup in which a manager model decomposes computer use tasks as a directed acyclic graph (DAG)<n>At each iteration, the manager dispatches parallel CUA subagents to carry out nodes on the ready frontier of the DAG.
  arXiv  Detail & Related papers  (2026-06-01T01:29:36Z)
• LACUNA: Safe Agents as Recursive Program Holes [3.2613419151327343]
  LLM agents increasingly act by writing code, yet a split persists between the runtime that drives the agent and the code the model writes.<n>We present LACUNA, a programming model for agents that closes this split while preserving safety.<n>Our primitive expresses ReAct loops, sub-agents, skills, parallel decomposition, and multi-model planning as ordinary control flow.
  arXiv  Detail & Related papers  (2026-05-27T15:27:25Z)
• A Policy-Driven Runtime Layer for Agentic LLM Serving [6.975319765760388]
  Multi-agent LLM systems have become the dominant production workload, but the serving stack was not built for them.<n>We argue this seam is best addressed by an architectural change rather than point fixes.<n>Preliminary results on five real multi-agent workloads show +13 to +37 pp cache hit-rate lift, 12% to 29% lower mean TTFT, and 6% to 14% higher throughput over an unmodified serving stack.
  arXiv  Detail & Related papers  (2026-05-26T22:38:34Z)
• Multi-agent Collaboration with State Management [21.19345862774123]
  When multiple agents edit a shared concurrently, their changes can silently conflict and inconsistent views lead to integration failures.<n>Existing multi-agent systems address this through workspace isolation (e.g., one git worktree per agent)<n>We propose STORM, i.e., STate-ORiented Management for multi-agent collaboration.
  arXiv  Detail & Related papers  (2026-05-19T23:45:33Z)
• ClawMark: A Living-World Benchmark for Multi-Turn, Multi-Day, Multimodal Coworker Agents [77.22389710754452]
  We introduce bench, a benchmark for coworker agents built around multi-turn multi-day tasks.<n>The current release contains 100 tasks across 13 professional scenarios, executed against five stateful sandboxed services.<n>The strongest model reaches 75.8 weighted score, but the best strict Task Success is only 20.0%, indicating that partial progress is common.
  arXiv  Detail & Related papers  (2026-04-26T16:05:02Z)
• Learning to Share: Selective Memory for Efficient Parallel Agentic Systems [49.78267008828593]
  Agentic systems solve complex tasks by coordinating multiple agents that iteratively reason, invoke tools, and exchange intermediate results.<n>Recent approaches deploy multiple agent teams running in parallel to explore diverse reasoning trajectories.<n>We propose Learning to Share (LTS), a learned shared-memory mechanism for parallel agentic frameworks.
  arXiv  Detail & Related papers  (2026-02-05T18:20:21Z)
• Runaway is Ashamed, But Helpful: On the Early-Exit Behavior of Large Language Model-based Agents in Embodied Environments [54.67512489842682]
  Large language models (LLMs) have demonstrated strong planning and decision-making capabilities in complex embodied environments.<n>We take a first step toward exploring the early-exit behavior for LLM-based agents.
  arXiv  Detail & Related papers  (2025-05-23T08:23:36Z)
• On the Resilience of LLM-Based Multi-Agent Collaboration with Faulty Agents [58.79302663733703]
  Large language model-based multi-agent systems have shown great abilities across various tasks due to the collaboration of expert agents.<n>The impact of clumsy or even malicious agents--those who frequently make errors in their tasks--on the overall performance of the system remains underexplored.<n>This paper investigates what is the resilience of various system structures under faulty agents on different downstream tasks.
  arXiv  Detail & Related papers  (2024-08-02T03:25:20Z)
• Federated Combinatorial Multi-Agent Multi-Armed Bandits [79.1700188160944]
  This paper introduces a federated learning framework tailored for online optimization with bandit. In this setting, agents subsets of arms, observe noisy rewards for these subsets without accessing individual arm information, and can cooperate and share information at specific intervals.
  arXiv  Detail & Related papers  (2024-05-09T17:40:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.