This work presents a tail-risk-aware turn release scheduling method that jointly decides which ready turn to release next and how much released but unfinished work to maintain, and reduces the P95 of workflow flow time under contention, achieving up to a \(3.50\times\) speedup.
Abstract
Agentic LLM workflows consist of sequences of model turns interleaved with tool interactions, so their end-to-end completion time depends not only on inference speed but also on when ready turns are released. Most runtimes release each turn immediately upon readiness. Under contention, this eager release policy can accumulate released but unfinished work; once submitted, those turns can no longer be reordered by the workflow-level policy, increasing tail latency. We present a tail-risk-aware turn release scheduling method that jointly decides which ready turn to release next and how much released but unfinished work to maintain. The method uses a mean--Conditional Value-at-Risk (CVaR) objective to capture the evolving tail risk of unfinished workflows, incorporates online estimates of turn work when prioritizing ready turns, and adapts the released work budget to observed queue pressure. We evaluate the method using real agent execution traces from software engineering tasks across multiple LLMs and workflow arrival rates. The method performs comparably to eager release under light load and substantially reduces the P95 of workflow flow time under contention, achieving up to a \(3.50\times\) speedup.
ProgRouter is presented, an online progress-guided routing framework that adaptively selects LLM agents across workflow steps to preserve task-solving quality while adhering to time and cost budgets and reduces the operating cost relative to key baselines while maintaining strong task-solving performance.
Song-Yuan Li, Ahmed M. Abdelmoniem, Shi-Qiang Wang· 2 citations
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
It is shown that pipeline parallelism (PP), long overlooked because it offers little decode-latency advantage, can reduce JCT by providing a more favorable balance between prefill and decode efficiency, and PipeSwift is built, an optimized open-source pipeline-parallel runtime integrated with a tailored micro-batch par...
Shiju Wang, Fei Ren, Fang-Cheng Fu et al.· 0 citations
LazyAgent is presented, a unified execution framework for agent-authored programs organized around a live, goal-derived demanded set that consistently outperforms the strongest goal-stopping eager baseline by refusing unrelated work before it starts and motivates benchmarks built from standing programs and sequences.
SemSpot is presented, a semantics-aware service model that allows agent applications to leverage the spot capacity of LLM inference platforms and develops the service model, economic boundary, and the cross-layer research agenda required to realize SemSpot.