LINEAR SCALING LAW
In a properly architected render farm, scaling is not exponential. It is arithmetic. Each node adds one unit of throughput. No more, no less.
I. THE SCALING PRINCIPLE
k = number of nodes in cluster
T(1) = base throughput of single node (frames·hr⁻¹)
T(k) = total cluster throughput at scale k
This is not optimization theory. It is physical necessity. A render farm distributes independent frame tasks across independent compute units. Task i runs on Node j. No task waits. No node idles (unless load balancing fails).
II. VISUAL PROOF
Plot: T(k) vs k for k ∈ [1, 8]. Slope = T(1). Linearity holds.
III. BOUNDARY CONDITIONS
Scaling fails when assumptions break:
- Load imbalance — Node idle time > 0 violates independence
- Network bottleneck — Frame distribution latency exceeds render time
- Storage contention — Shared disk I/O serializes parallel writes
- Task granularity — Frames too large to distribute cleanly
EFFICIENCY FACTOR η:
η = T(actual) / T(ideal)
Perfect cluster: η = 1.0. Real cluster: η ≈ 0.85–0.95. Anything below 0.7 indicates architecture failure.
IV. PHYSICAL INSTANCES
Antonio's torque specification is the mechanical analog. 140 ft-lbs is not arbitrary — it is the yield threshold of Grade 8 steel. Similarly, T(k) = k × T(1) is not metaphor — it is the yield threshold of parallel computation.
FIFA 2026 requires 16 venues, 104 matches, simultaneous broadcast. The cluster size is determined by dividing required throughput by single-node capacity. Arithmetic. Nothing else.
V. ARCHITECTURAL EVIDENCE
Server rack density determines node count. Each rack is a discrete unit of T(1). Total throughput = sum of all racks.
RELATED: render-farm-theory.html | render-farm-calculator.html | render-farm-spec.html
IMAGE: Pexels photo 37730212 — license-clean, no attribution required