m3taversal
be8ff41bfe
Wrote sourced_from: into 414 claim files pointing back to their origin source. Backfilled claims_extracted: into 252 source files that were processed but missing this field. Matching uses author+title overlap against claim source: field, validated against 296 known-good pairs from existing claims_extracted. Co-Authored-By: Claude Opus 4.6 (1M context) <noreply@anthropic.com>
2.3 KiB
| type | domain | description | confidence | source | created | supports | reweave_edges | sourced_from | |||
|---|---|---|---|---|---|---|---|---|---|---|---|
| claim | internet-finance | Optimal server provisioning follows R + β√R formula where R is base load and β controls service level | proven | Ward Whitt, What You Should Know About Queueing Models (2019) | 2026-03-11 |
|
|
|
Square-root staffing principle provisions servers as base load plus beta times square root of base load where beta is quality-of-service parameter
The square-root staffing rule provides optimal server provisioning: if base load requires R workers at full utilization, provision R + β√R workers where β ≈ 1-2 depending on target service level. This formula emerges from queueing theory analysis of multi-server systems and represents the sweet spot between over-provisioning (wasteful) and under-provisioning (queue explosion).
The principle applies across domains: call centers, compute pipelines, service systems. For Teleo pipeline scale (~8 sources/cycle, ~5 min service time), this gives concrete worker count guidance without requiring peak-load provisioning.
The underlying insight: variance in arrival and service times creates queueing delays even when average utilization is below 100%. The square-root safety margin handles this variance efficiently. The margin grows with system size but at a sublinear rate, creating economies of scale.
Evidence
Ward Whitt's practitioner guide establishes this as the foundational staffing principle in operations research. The formula derives from the Halfin-Whitt heavy-traffic regime analysis, where systems operate near full utilization (approaching 1 at rate Θ(1/√n) as servers n grow) while keeping delays manageable.
Erlang C formula provides the computational implementation for determining β given target service levels (probability of delay, average wait time).
Relevant Notes:
- domains/internet-finance/_map
Topics:
- core/mechanisms/_map