Skip to content
Preprint

AiFlow: Token-Native Reactive Orchestration with Bounded Backpressure for Streaming LLM Applications

Aug 2026 · 0 citations · 40 references
Computer Science

TL;DR

AiFlow is presented, a token-native reactive orchestration model that normalizes provider deltas into typed Contextevents propagated through a directed streaming graph and formalizes the bounded-memory property, presents the compilation from a compact DSL and JSON graph form, and provides static validation for type safety, state concurrency, and injection compatibility.

Abstract

Large language model (LLM) applications increasingly operate as streaming workflows combining retrieval, tool calls, safety filters, and multi-agent coordination. Although contemporary frameworks expose provider deltas, workflow nodes often treat generation as coarse request-response steps, leaving queue management, worker allocation, ordering, and backpressure to ad hoc callback code. This paper presents AiFlow, a token-native reactive orchestration model that normalizes provider deltas into typed Contextevents propagated through a directed streaming graph. Each node is managed by a Node Guardian that declares and enforces local queue bounds, worker concurrency, ordering, overflow policy, cancellation propagation, and retry discipline. We formalize the bounded-memory property, present the compilation from a compact DSL and JSON graph form, and provide static validation for type safety, state concurrency, and injection compatibility. Controlled microbenchmarks, captured DeepSeek trace replay (30 runs), descriptive online runs, LangGraph baselines, a streaming RAG workload, and an Ollama local-backend check show that AiFlow does not alter provider-side Model TTFT but reduces Application TTFPT by 70.9-94.7\% versus aggregation and keeps runtime-owned queue depth within declared bounds (93.7-96.5\% MaxQ reduction versus unbounded policies). The supplementary artifact contains scripts, raw traces, machine-readable tables, checksums, and an API-free smoke test; the public implementation is available through the FIT Framework repository.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Substrate-Portable Execution for Production LLM Workflows

This work validated dozens of production agent configurations across five orchestration patterns: single-inference RAG, iterative ReAct, compositional PreAct, conditional routing, and multi-agent deep research, and found no detectable difference in output quality.

T. Gopinath, Atul Kulkarni, V. Rajakumar et al. · 0 citations
Open access Oct 2026

AsyncLeakBench: A Curated Benchmark of Asynchronous Resource Leaks in Open-Source Java Projects

Asynchronous programming is widely used in modern Java software, including server-side processing, network I/O, reactive streams, task scheduling, and RPC communication. Unlike synchronous executions, resource creation and release in asynchronous programs are distributed across callbacks, Future/Promise chains, threads...

Jinyoung Kim, Jinseok Heo, Dongwook Choi et al. · 0 citations
Book Open access Sep 2026

Demonstrating SAGE: A Dataflow-Native Framework for Modular, Controllable, and Transparent LLM-Augmented Reasoning

This demo presents SAGE as a pipeline-native runtime system and demonstrates it through an OPC-facing control plane and includes a compact distributed comparison against a LangChain RPC baseline over a shared 15-workload RAG suite, where SAGE nearly doubles full-RAG throughput under matched 8-node settings.

Jun Liu, Shu-Hao Zhang · 0 citations
Preprint Aug 2026

AgentFlow: A Flow-Centric Policy Language and Framework for Securing LLM Agent Systems

AgentFlow, a flow-centric policy language and runtime enforcement model for specifying where data may travel in agent systems, is presented and results are preliminary and scoped to the modeled policy-visible agent behaviors and evaluated benchmarks.

B. Shivakumar, Swarn Priya, Peng Gao · 2 citations
Preprint Sep 2026

AKTS: Sub-Microsecond Kernel Policy Switching for Language-Model Agents

AKTS, which verifies a policy library once, at load time, and reduces the agent's runtime action to writing an integer index into an in-kernel array of preverified policies, and an in-kernel tail call resolves that index.

Mohammadali Khodabandehlou, Mahdi Alizadeh · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.