Skip to content
Conference

FlowGuard: Slack-Aware Overload Control for Multi-Agent LLM Serving

Jul 2026 · International Conference on Computer Communications and Networks · pp. 1-9 · 0 citations · 23 references

Abstract

Multi-agent applications increasingly rely on shared large language model backends in the public cloud, where bursty workloads cause requests from different agents to contend for the same LLM instances, leading to long queues, memory imbalance, and severe tail-latency inflation. Existing approaches typically prioritize requests using coarse workflow positions or static execution heuristics, which fail to adapt to short-term overload dynamics. We present FlowGuard, a workflow-aware overload controller for multi-agent LLM serving. Its key insight is that under sustained overload, GPU cycles spent on requests whose execution service-level-objectives (SLOs) are already violated are wasted. FlowGuard continuously recomputes per-request slack and prioritizes requests with the greatest remaining time before their deadlines, thereby maximizing on-time completions. In addition, a resource-aware dispatcher jointly accounts for KV-cache memory pressure and in-flight queue depth to reduce preemption across shared instances. Evaluated on a deliberately over-subscribed two-GPU backend, where all policies exhibit high absolute miss rates (i.e., the percentage of workflows that miss their deadlines), FlowGuard reduces the miss rate by 14–28% points over workflow-oblivious and static-priority baselines under BurstGPT-driven load, and by 34–38% points under co-located mixed-agent workloads.

View source

Similar papers

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
Conference Jul 2026

UNAS: Urgency- and Fairness-Aware Scheduling for SLO-Oriented LLM Serving

The widespread adoption and strong generalizability of large language models (LLMs) lead to highly heterogeneous workloads that exhibit substantial variability in request lengths and latency requirements. This pronounced heterogeneity causes existing scheduling strategies to suffer from head-of-line blocking and ineffi...

Tian-Nan Fu, Jianxiong Liao, Xu Chen et al. · 0 citations
Jul 2026

SpecBox: Speculative Sandbox Scheduling for Efficient LLM Agent Serving

This work presents SpecBox, a runtime built around speculative sandbox preallocation tailored for dynamic LLM agent execution pipelines, and implements keyword matching and streaming semantic embedding to enable intent-driven sandbox prewarming, which identifies pending tool execution demands mid-LLM token generation a...

Yi-Hui Zhang, Tian-Yu Wo, Jing-Hao Wang et al. · 1 citation
Conference Jul 2026

WaSMa: Workflow-Aware Scheduling for Multi-Agent LLM Systems

Public LLM services serve diverse multi-agent applications with varying workflow dependencies and performance requirements. Requests generated by these applications often exhibit commonality and interdependence, yet current systems largely ignore such application-level structure. As a result, at the LLM engine cluster...

Uttam Rao, Ali Zafar Sadiq, Hai-Ying Shen et al. · 0 citations
Preprint Aug 2026

Cascade: Exploiting SLO-Aware latency budget for fair and high goodput LLM inference serving

Cascade, an LLM serving system that estimates and continuously updates this per-request latency budget from request characteristics, KV-cache state, and current system load, and uses a single per-request budget to jointly coordinate request scheduling and KV-cache management across the memory hierarchy.

Muhammad Adnan, R. Mahapatra, Prashant J. Nair et al. · 0 citations
Preprint Sep 2026

Latency-Aware Orchestration for Multi-Agent LLM Workflows on Heterogeneous GPUs

A prediction-guided runtime that uses workflow forecasts to construct and optimize a physical execution graph and reduces end-to-end makespan and overall p95 completion latency under burst arrivals by up to 36.8% and 25.8% over state-of-the-art workflow schedulers.

Jing-Hao Wang, Yi-Feng Zhang, Xiao Zhou 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.