Rung 03 / How you run it cheaply, per token

Serving & Runtime

How a model is actually run, per token — the mechanics that turn capability into throughput.

17
Sources
6
Concepts
5
Entities
A brushed steel manifold with four copper outlet pipes, on paper.

In scope: batching and scheduling, KV-cache management and eviction, quantization at serving time, speculative decoding, prefill/decode disaggregation, paged attention, routing, throughput and latency engineering. Out: what the model can do (models), what a finished task costs (inference-economics), the silicon it runs on (hardware).

A slotted tray whose queues fill to uneven depths — continuous batching.
KV cacheBatchingSpec decodingPrefill/decode
Analysis only1Show all →
Sources compiled for this topic
TypeSourcePublished
ANALYSISToken Economics Across Traffic Profiles on Dedicated GPUs (measured H200 serving-cost benchmark)
Vinayak Baranwal · DigitalOcean

First MEASURED cost-per-token series in this KB: single H200 ($3.44/GPU-hr, Llama-3.3-70B FP8, vLLM 0.24.0), swept batch 1->256, yields $20.32 -> $0.45 per M output tokens (~44x spread on ONE SKU from traffic shape alone), independently reproducing Patil's utilization thesis with dollar-anchored levels. As-of 2026-07-08; MEASURED throughput, cost derived at list rate.

2026-07-08
Serving & Runtime | Knowledge Base | MenFem