Skip to content

InstantInfer: Enabling Fast LLM Cold Start with Communicating Finite Automata

Jul 2026 · arXiv.org · Vol abs/2607.18957 · 0 citations · 37 references
Computer Science

TL;DR

This work proposes the Communicating Finite Automata (CFA) abstraction to systematically analyze cross-component optimization opportunities, and designs a programming framework to enable CFA-based component program refactoring that preserves the original sequential program structure while enabling safe concurrent component execution.

Abstract

Cold starts in large language model (LLM) inference services significantly affect user experience, yet they remain inefficient due to sequential initialization and a massive number of fine-grained I/O requests issued by complex software components. Although refactoring the program can yield advantages such as concurrent execution and I/O merging, this approach is error-prone and carries correctness risks when dealing with massive, heterogeneous components. We propose the Communicating Finite Automata (CFA) abstraction to systematically analyze cross-component optimization opportunities, and design a programming framework to enable CFA-based component program refactoring. This framework preserves the original sequential program structure while enabling safe concurrent component execution. We prove the correctness of the program refactoring. We apply the CFA abstraction and framework to refactor process tree creation, tensor loading, and model switching in vLLM, forming a new cold-start system named InstantInfer. Extensive experiments demonstrate that InstantInfer substantially accelerates LLM cold starts (achieving up to 7.2 times speedup) and exhibits robustness across diverse GPUs, workloads, and scales.

View source

Similar papers

#artificial intelligence Preprint Sep 2026

Dynamic Adaptation of the LLM Context for Generating Routines with Coupled Semantics

LLM-based code generation fails when correctness depends on execution-dependent coupling: the meaning of one routine is defined by the runtime behavior of another, a relationship that cannot be resolved from textual descriptions alone. This limitation, which we call static binding, is not confined to explicitly coupled...

Gnaneswar Villuri, Hashmath Shaik, Alex Doboli · 1 citation
Conference Open access Sep 2026

QiMeng-VPID: Verification-Grounded Port-Level Iterative Decomposition for Complex Verilog Generation

This work proposes VPID, a multi-agent framework for generating complex Verilog that achieves monotonic functional improvement and introduces an experience-guided refinement strategy that distills historical waveform mismatches into constraints, guiding the targeted debugging for the unverified ports.

Hong-Guang Wang, Jiaming Guo, Rui Zhang et al. · 0 citations
Preprint Aug 2026

PeakBench: Benchmarking Resource-Aware Tool Invocation in LLM Agents

PeakBench is a benchmark of executable multi-tool workflows with execution-grounded dependency annotations and measured resource profiles that shows that strong logical planning does not reliably translate into safe or efficient execution under resource constraints, and exposes resource information to reduce avoidable...

Zhi-Kai Chen, Xu-Xiang Zhong, Song-Yan Li et al. · 2 citations
#artificial intelligence Preprint Sep 2026

EvolveScaler: Synthesizing Information-Evolution Contexts via Executable State Machines and Natural-Language Rendering

This work introduces EvolveScaler, a code-driven framework that defines information evolution before rendering it as natural language, and shows that code-driven IE synthesis provides both challenging evaluation and transferable training supervision.

Ziliang Zhao, Ze-Nan Xu, Shuting Wang et al. · 0 citations
Jul 2026

FAVA: Formal Authorization for Verified Agents with Evidence-Backed Permission Graphs

This work presents FAVA (Formal Authorization for Verified Agents), a permission-carrying authorization framework for agent execution that utilizes an LLM-guided Permission Intermediate Representation to translate ambiguous natural-language tasks into structured constraints.

Yifan Zhang, Xin-Kui Zhao, Sai-Da Liu et al. · 3 citations
Preprint Aug 2026

SkillEffect: Checked Lowering for Memory-Bounded Agent Tools

SkillEffect is presented, a checked-lowering runtime for computations with a recoverable source relation, an audited bounded implementation, and a registered output postcondition that shows that one checked-lowering architecture can enforce heterogeneous registered memory relations at Agent tool dispatch.

Yi-Nuo Wang, Yiyu Shi · 0 citations

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