Feynman Letter: Are You Adding Lanes to the Hub, or Teaching Traffic Lights to Recognize Ambulances? — On Strait's Large-Scale Inference Scheduling
After reading Strait (2026.05), a systems paper on machine learning inference serving, I feel like the "compute gridlock" in the data center finally has its ultimate traffic cop.
To help you understand why systems collapse when tens of thousands of people hit a large-model API at once, let's talk about "queuing."
1. The Status Quo: A Rigid Toll Booth with No Sense of Priority
Today's large-model serving clusters handle billions of requests daily.
- The pain point: Traditional schedulers (like plain FIFO queues) are like an extremely rigid highway toll booth. Whether you're a heavy truck hauling dozens of tons (complex inference over very long contexts) or an ambulance rushing to save lives (VIP real-time conversations needing millisecond responses), everyone queues in the same lane. If a long line of trucks happens to jam ahead, the ambulance can only sit and wait. This is "physical congestion lacking perception dimensions."
- Perceiving Priority: The system can attach dynamic labels to requests based on business logic. A VIP user's short request gets instantly promoted — like giving an ambulance privileges to bypass trucks via the emergency lane.
- Physical Picture (Perceiving Interference): This is the most impressive part. Inside a GPU, if you co-run two tasks that heavily consume the same memory bandwidth (Batching), they fight over physical resources (compute stomping). Strait can predict this "physical rejection reaction" in advance. Like a seating planner, it puts the "CPU-hungry" and the "memory-hungry" at the same table, never letting two big eaters collide. This is "micro-scheduling based on hardware affinity."
2. Strait: The Super Traffic Cop with X-Ray Vision
The logic of the Strait system proposed in this paper is bold: I won't just add lanes — I'll let the cop instantly see through the importance and destructiveness of every vehicle.
It implements two layers of geek-level scheduling redesign:
3. A Feynman-Style Judgment: Efficiency Is "Staggered Matching of Resources"
So-called "high concurrency" is not simply flattening tasks and stuffing them into machines.
It is: whether you can, within microsecond-scale time windows, perceive the physical character of every compute task and mesh them together like gears on the GPU's limited silicon resources.
Strait tells us: the AI-era infrastructure race has moved from "buying GPUs" to "squeezing the last drop out of the silicon."
Only when the scheduling system has a god's-eye view — navigating fluidly between macro-level business priorities and micro-level memory contention — have we truly tamed these unruly compute monsters.
Takeaway
When optimizing any high-concurrency system, stop relying on the naive "first come, first served" queue.
Build your "resource interference matrix."
If you can't tell whether the tasks entering your system are lions or sheep, and you lock them into the same cage (Batch), the price you pay will be a total collapse of system compute.