Talk Session 3: Frameworks & Dev Platforms

vLLM: Building Open and Efficient Inference for Agents

Woosuk Kwon — Co-Founder & CTO, Inferact

Saturday, August 1 · Atlas Stage · 03:44:21–04:00:55 · afternoon stream

Agents barely changed the inference API but changed everything underneath it — so vLLM is rebuilding along three axes: workload-aware model parallelism, dynamic hierarchical KV cache, and enough hardware backends to turn any compute on earth into tokens.

TL;DR

  • The API didn't change; everything under it did. vllm serve still hands you an OpenAI- (and Anthropic-) compatible endpoint that any agent framework speaks out of the box. Agents rewrote the engine, not the interface.
  • Three axes of pressure: bigger models (trillion-parameter agent models like Kimi K3 and DeepSeek V4 force serious model parallelism), longer context (hundreds of turns, up to a million tokens, with recomputation strictly forbidden), and unbounded token demand growing faster than GPU supply.
  • Parallelism has no universal winner. vLLM supports seven kinds, including a decode context parallelism that doesn't exist in training — but the right choice depends on model architecture × cluster setup × workload shape. In one real case a TP × PP × EP configuration across 16 GPUs beat the obvious single-host 8-way TP baseline on both TTFT and per-GPU throughput.
  • Hybrid models turn memory partitioning into a dynamic problem. Full attention's KV cache grows linearly with context; linear attention (e.g. Kimi Delta Attention) keeps a fixed-size state per sequence. vLLM replaces static partitioning with one shared pool, per-attention-type allocators, and automatic rebalancing.
  • Token economics have flipped: once models are smart enough, a token is worth far more than it costs to generate, so demand is effectively unbounded and there aren't enough GPUs on earth — hence a plugin architecture spanning 10+ hardware backends.

Key Points

Where vLLM stands, and the two ways to use it (~03:45–03:47)

Kwon introduces himself as a co-creator of vLLM and co-founder of Inferact, the startup built around it. vLLM is an open-source LLM inference engine whose goal is to make LLM inference "efficient and effortless." It started roughly three years ago at UC Berkeley during his PhD and has grown fast ever since — around 88k GitHub stars as of shortly before the talk. He stresses that it is a highly collaborative project across academia and industry, with major contributors including Red Hat, NVIDIA, AMD, Google, and Moonshot alongside Inferact, and that it is widely deployed for production inference.

Two entry points. Offline batch inference goes through the Python LLM class: pass a Hugging Face model name, call generate, done — model loading, optimization, scheduling, memory management, and GPU utilization are all handled underneath. Online serving is a single vllm serve command yielding an OpenAI-compatible endpoint; Anthropic APIs are supported too, so any agent framework that speaks either works out of the box.

Which sets up the hinge of the talk: that API looks much as it did a few years ago — agents barely changed it. What agents changed enormously is everything underneath.

The three pressures agents apply (~03:47–03:49)

First, large models. Frontier agent models — Kimi K3, DeepSeek V4 — are around a trillion parameters, forcing everyone to get serious about model parallelism. He frames this as opportunity: it opens many creative ways to shard a model, each with different trade-offs.

Second, long context. Agent sessions run for hundreds of turns, up to a million tokens, and context only grows over a session. Managing the KV cache of prior turns is therefore critical, and the engine must never recompute tokens from a previous turn — otherwise you get enormous duplicated computation and wasted compute.

Third, enormous token demand. As agents get smarter and more capable there are near-infinite places to deploy them, so demand is effectively unbounded — and growing faster than GPU supply. vLLM's response is to make efficient inference work on many more hardware backends so that all available compute can be turned into tokens.

Axis 1: no universal winner in parallelism (~03:49–03:53)

vLLM today supports seven main kinds of parallelism: tensor, pipeline, data, expert, sequence, and two flavors of context parallelism — one of which, decode context parallelism, is parallelism around the KV cache and has no analogue in training. As a general-purpose engine, vLLM implements all of them efficiently, and mixtures of them.

That, he says, is not enough. These parallelisms must be selected and tuned for the target model architecture, the target cluster setup, and the target workload shape. There is no universal winner.

The worked example: prefill for a DeepSeek model on B200 GPUs in a disaggregated serving setup, where this pool of GPUs only does prefill. The most straightforward deployment is single-host 8-way tensor parallelism — standard and simple. The winning configuration is nothing like it: a combination of tensor, pipeline, and expert parallelism (plus sequence parallelism) spread across 16 GPUs per model replica, delivering substantially lower TTFT and substantially higher per-GPU throughput than the 8-way TP baseline.

Why: pipeline parallelism enables parallelism across chunks within a long prefill; sequence parallelism enables more communication–computation overlap; and expert parallelism yields better GEMM shapes than 8-way tensor parallelism. The takeaway is that in the agentic era you need the right insight and performance model to configure this correctly — and vLLM's contribution is the common substrate on which you can play with all of these parallelisms.

Axis 2: KV cache, from static partitioning to dynamic rebalancing (~03:53–03:58)

A defining property of modern LLMs is that they are hybrid: global attention layers interleaved with cheaper mechanisms such as sliding-window or linear attention (Kimi Delta Attention being his example). That interleaving is what makes million-token context feasible at all, since global attention alone consumes too much memory at that scale.

Elegant in theory, genuinely hard in practice, because layers of different attention types have completely different memory behavior. Full attention's KV cache grows linearly with context; a linear-attention layer like KDA keeps a fixed-size state per sequence regardless of actual context length. So how should GPU memory be carved between them?

The straightforward answer is static partitioning — reserve x% for full attention, y% for the rest. It works, but the optimal split depends on batch size and context length, both of which move continuously during inference.

vLLM's answer is dynamic partitioning: one shared GPU memory pool, with each attention type getting its own allocator drawing from it. The full-attention allocator requests from the pool by token count; the KDA allocator, being linear attention, allocates one large block for the entire sequence; and logic between them shares the same memory space dynamically. The engine rebalances automatically so no GPU memory is wasted, and the user never has to reason about the split.

Managing KV cache within GPU memory isn't sufficient, though. Agent sessions are long-lived and intermittent: generate some tokens, then wait — for tool calls, sometimes for a human — then continue. During those waits the KV cache has to live somewhere. vLLM's abstraction is the KV connector, which stores idle KV cache in external memory (CPU memory or disk) and brings it back on demand. He notes real design effort went into making that abstraction work with third-party libraries like Mooncake and with mechanisms like prefill/decode disaggregation, where KV movement is itself dynamic and complex — cache has to move from prefill instances to decode instances, and from prefill instances to a distributed KV storage pool. The purpose of all that infrastructure is one guarantee: in a many-turn agent session, as long as storage allows, never recompute tokens from previous turns.

Axis 3: hardware — turning all the compute on earth into tokens (~03:58–04:00)

Kwon argues the economics of tokens are flipping: as models get more intelligent, the value of a token far exceeds the cost of generating it. Demand explodes accordingly, and honestly there are not enough GPUs in the world to serve it. So the question becomes: can we use all available compute on earth to generate tokens efficiently?

vLLM's answer is 10+ hardware backends today. NVIDIA GPUs are the major focus, but Google TPUs, AMD GPUs, and various other industry chips are supported through a plugin structure that shares vLLM's core while customizing hardware-specific parts. This makes particular sense in inference, he argues, because the API layer is already standardized — you keep using the same OpenAI or Anthropic API while different silicon generates the tokens underneath.

He skips the detail slides for time, leaving the TL;DR: bringing up new hardware and making it efficiently support new models is getting easier because of coding agents, but it still requires retaking the entire inference stack from the ground up, and the team is actively working on it.

Summary: the agentic era stresses inference along three axes, and vLLM answers each — large models with workload-aware model parallelism, long context with a dynamic and hierarchical KV cache, exploding token demand with diverse hardware backends. Everything shown is open source.

Quotes

"The API itself is pretty much similar to a few years ago … What has changed a lot for agents is everything underneath it." (~03:47)

The framing device for the whole talk: the agent revolution happened below the API.

"There's no universal winner." (~03:50)

Parallelism has no default answer, only an answer for a given model × cluster × workload.

"As models get smarter, the value of a token far exceeds the cost of generating it … and honestly there are not enough GPUs in the world to serve it." (~03:58)

Multi-backend support is not a compatibility nicety; it is a supply-side necessity.

提到的專案與資源 / Projects & Resources

名稱 Name 說明 Description 備註 Notes
vLLM 開源 LLM 推論引擎,2023 年起於 UC Berkeley;約 88k GitHub stars Open-source LLM inference engine, started at UC Berkeley ~3 years ago; ~88k GitHub stars 貢獻者含 Red Hat、NVIDIA、AMD、Google、Moonshot、Inferact / contributors include Red Hat, NVIDIA, AMD, Google, Moonshot, Inferact
Inferact 圍繞 vLLM 成立的新創,講者為共同創辦人兼 CTO Startup built around vLLM; the speaker is co-founder and CTO
Decode context parallelism 圍繞 KV cache 的平行化,訓練世界不存在 Parallelism around the KV cache; has no counterpart in training vLLM 七種平行化之一 / one of vLLM's seven parallelism types
KV connector 把閒置 KV cache 卸載到 CPU 記憶體或磁碟並取回的抽象層 Abstraction for offloading idle KV cache to CPU memory or disk and retrieving it 與 prefill/decode 分離協同運作 / interoperates with prefill/decode disaggregation
Mooncake 分散式 KV cache 儲存池,vLLM 的 KV connector 與之整合 Distributed KV cache storage pool integrated with vLLM's KV connector 逐字稿作 "moon key" / "Moon Cake"
Kimi Delta Attention (KDA) Kimi K3 採用的 linear attention 機制,是 hybrid 模型記憶體行為差異的代表 The linear-attention mechanism in Kimi K3; his example of divergent memory behavior in hybrid models Moonshot AI
Kimi K3 / DeepSeek V4 演講中舉例的 trillion 級前沿 agent 模型 Trillion-parameter frontier agent models cited as examples

逐字稿勘誤 / Transcript Corrections

字幕原文 Heard as 應為 Should be
Wusak Quan / Usok / Wuk Woosuk Kwon
Infirect / Infact Inferact
VLM / EDLM VLM / VM vLLM(自動字幕把 LLM 與 vLLM 混淆)
deepse pro / deep 4 DeepSeek(V4)
Kimmy K3 Kimi K3
KDA / sighting window Kimi Delta Attention / sliding window
moon key Mooncake
Redhead Red Hat
TTFP TTFT (time to first token)
accessor parallelism expert parallelism
reccast requests
disagregation / disegration disaggregation

待確認 / To Verify

  • B200 prefill 案例的精確平行化度數(逐字稿把 "two-way tensor parallel × … pipeline parallel × eight-way …" 講得含糊,只能確定總計 16 GPU / replica、由 TP × PP × EP 組成)。/ The exact parallelism degrees in the B200 prefill case — the transcript garbles the numbers; only "16 GPUs per replica, TP × PP × EP" is reliable.
  • 案例中的 DeepSeek 模型是哪一個版本(字幕作 "deepse pro",可能是 DeepSeek V4 Pro)。/ Which DeepSeek variant the B200 case used (transcript "deepse pro", possibly DeepSeek V4 Pro).
  • 88k GitHub stars 為講者口述的近期數字,未指定日期。/ The 88k GitHub stars figure was stated verbally as "pretty recently," without a date.
  • 「10 種以上硬體後端」的完整清單未在演講中列出(僅明確提到 NVIDIA、Google TPU、AMD)。/ The full list of "more than 10 hardware backends" was not enumerated; only NVIDIA, Google TPU, and AMD were named.

Markdown source on GitHub ↗