About this paper
TAO improves scheduling for LLM agent services by considering tool readiness and using dynamic programming to place sessions, reducing latency and increasing throughput.
Agentic services alternate between model inference on clustered GPUs and external tools on distributed CPUs. In this scenario, existing systems (1) overlook tool-return readiness in service evaluation, wasting limited resources, and (2) use heuristic strategies to decide admission and placement on GPUs, resulting in suboptimal scheduling decisions. To bridge this gap, we present TAO, a tool-aware joint scheduling framework for LLM-based agentic serving. Its value interface combines near-term tool readiness, node-specific cache credit with time-aware decay, and token footprint; a dynamic program jointly selects and places waiting sessions under capacity constraints. Across the 12 reported…
LLM-based agentic servingtool-aware schedulingtool-return readinessnode-specific cache credittime-aware decaytoken footprintdynamic programmingadmission and placementdecode throughputtime to first token (TTFT)
- Upvotes
- 13
- Authors
- 5
- Published
- Oct 27, 2026
Summary and abstract excerpt via Hugging Face Papers ↗ · arXiv.
Trending history
TAO: Tool-Aware Joint Scheduling for LLM-Based Agentic Serving was first seen on Hugging Face · Daily papers on Oct 29, 2026. Since then it has appeared in 15 checks on 2 different days. Its best position was #9 of 30, reached on Oct 30, 05:28 UTC. It dropped off the list after Oct 30, 15:28 UTC.