# Who Schedules Agent Memory? A Sidecar Approach to Long-Horizon Tasks

DevFeed: [Who Schedules Agent Memory? A Sidecar Approach to Long-Horizon Tasks](<https://devfeed.tech/articles/who-schedules-agent-memory-a-sidecar-approach-to-long-horizon-tasks-115089.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.00779>)

Author: Qijia Zhuang (Nanjing University), Rui Liu (Northeastern University), Yuxiang Ren (Nanjing University)

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [scheduling](<https://devfeed.tech/topics/scheduling.md>), [AI Agent](<https://devfeed.tech/topics/ai-agent.md>), [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Multi Agent Systems](<https://devfeed.tech/topics/multi-agent-systems.md>), [async](<https://devfeed.tech/topics/async.md>), [AI-driven information retrieval](<https://devfeed.tech/topics/ai-driven-information-retrieval.md>)

Tags: [agent](<https://devfeed.tech/tags/agent.md>), [agent-memory](<https://devfeed.tech/tags/agent-memory.md>), [cache](<https://devfeed.tech/tags/cache.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [hooks](<https://devfeed.tech/tags/hooks.md>), [horizon](<https://devfeed.tech/tags/horizon.md>), [latency](<https://devfeed.tech/tags/latency.md>), [mcp](<https://devfeed.tech/tags/mcp.md>), [memory](<https://devfeed.tech/tags/memory.md>), [parallel](<https://devfeed.tech/tags/parallel.md>), [queries](<https://devfeed.tech/tags/queries.md>), [retrieval](<https://devfeed.tech/tags/retrieval.md>), [scheduling](<https://devfeed.tech/tags/scheduling.md>), [sidecar](<https://devfeed.tech/tags/sidecar.md>), [storage](<https://devfeed.tech/tags/storage.md>)

## AI overview

MemSidecar separates memory scheduling from task execution to reduce the main agent's retrieval burden and waiting time in long-horizon tasks. Its Hooks mode delivers bound memory when execution events match predefined conditions. Foresight uses an independent agent to predict likely queries, retrieve results in parallel, and cache them for delivery when matching valid requests arrive. On MCP-Persona, the abstract reports scores of 41.23% for Hooks and 44.34% for Foresight, and says both reduce execution costs and latency; the excerpt provides no further evaluation details.

## Source excerpt

arXiv:2611.00779v1 Announce Type: new Abstract: As large language model agents increasingly undertake complex, long-horizon tasks, memory has become an important component for supporting sustained decision-making and action. Existing methods primarily focus on memory storage, updating, and retrieval, but often overlook how memory scheduling affects task execution: the main agent must identify memory needs, initiate retrieval, and wait for results while advancing the task, increasing both scheduling burden and execution time. To address this problem, we propose MemSidecar, which decouples memory scheduling from task execution through two independently selectable modes. Hooks directly delivers bound memory to the main agent when execution events match predefined conditions. Foresight uses an independent agent to predict potential queries, retrieve results in parallel, and store them in a cache, delivering matching and valid results when actual requests arrive. Hooks and Foresight achieve scores of 41.23% and 44.34% on MCP-Persona, respectively, while effectively reducing execution costs and latency and improving the efficiency of long-horizon agent execution.