extract: 2022-06-07-slimmon-littles-law-scale-applications

Pentagon-Agent: Ganymede <F99EBFA6-547B-4096-BEEA-1D59C3E4028A>

domains/internet-finance/littles-law-provides-minimum-worker-capacity-floor-for-pipeline-systems-but-requires-buffer-margin-for-variance.md

@@ -0,0 +1,37 @@
+---
+type: claim
+domain: internet-finance
+description: "Little's Law calculates theoretical minimum capacity but real systems need safety margin above that floor"
+confidence: proven
+source: "Dan Slimmon, 'Using Little's Law to Scale Applications' (2022-06-07)"
+created: 2026-03-11
+---
+
+# Little's Law provides minimum worker capacity floor for pipeline systems but requires buffer margin for variance
+
+Little's Law (L = λW) gives the theoretical minimum capacity for steady-state systems: total workers needed ≥ (arrival rate) × (average processing time). This is the floor, not the ceiling. Real systems require buffer capacity above this minimum to handle variance in arrival rates and processing times.
+
+For a system processing 1000 requests/second with 0.34s average processing time, Little's Law calculates 340 concurrent requests needed at steady state. However, this assumes perfect uniformity. Production systems experience bursts, outliers, and cascading delays that the long-term average doesn't capture.
+
+The formula is valuable for capacity planning because it establishes the lower bound — you cannot run below this threshold without queue buildup. But it's not a complete scaling solution. The gap between theoretical minimum and operational capacity is where queueing theory, square-root staffing rules, and empirical load testing fill in.
+
+## Evidence
+
+- Little's Law: L = λW where L = average items in system, λ = arrival rate, W = average time per item
+- Rearranged for capacity: (total worker threads) ≥ (arrival rate)(average processing time)
+- Practical example from source: 1000 req/s × 0.34s = 340 concurrent requests needed
+- Source explicitly notes: "Little's Law gives long-term averages only — real systems need buffer capacity beyond the theoretical minimum to handle variance"
+
+## Application to Pipeline Architecture
+
+For Teleo pipeline: if processing ~8 sources per extraction cycle (every 5 min) and each takes ~10-15 min of Claude compute, Little's Law says L = (8/300s) × 750s ≈ 20 sources in-flight at steady state. With 6 workers, each handles ~3.3 sources concurrently — which means workers must pipeline or queue buildup occurs.
+
+More generally: λ = average sources per second, W = average extraction time. Total workers needed ≥ λ × W gives the minimum worker floor. Additional capacity rules (like square-root staffing) provide the safety margin above that floor.
+
+---
+
+Relevant Notes:
+- domains/internet-finance/_map
+
+Topics:
+- core/mechanisms/_map

inbox/archive/2022-06-07-slimmon-littles-law-scale-applications.md

@@ -6,8 +6,13 @@ url: https://blog.danslimmon.com/2022/06/07/using-littles-law-to-scale-applicati
 date: 2022-06-07
 domain: internet-finance
 format: essay
-status: unprocessed
+status: processed
 tags: [pipeline-architecture, operations-research, queueing-theory, littles-law, capacity-planning]
+processed_by: rio
+processed_date: 2026-03-11
+claims_extracted: ["littles-law-provides-minimum-worker-capacity-floor-for-pipeline-systems-but-requires-buffer-margin-for-variance.md"]
+extraction_model: "anthropic/claude-sonnet-4.5"
+extraction_notes: "Single practitioner guide on applying queueing theory to capacity planning. Extracted one claim about the gap between theoretical minimum and operational capacity requirements. The source is primarily instructional rather than making novel arguable propositions — most content is established operations research applied to web systems. Key insight is the explicit caveat that Little's Law provides floor not ceiling."
 ---
 
 # Using Little's Law to Scale Applications
@@ -27,3 +32,9 @@ Practitioner guide showing how Little's Law (L = λW) provides a simple but powe
 Direct application: if we process ~8 sources per extraction cycle (every 5 min) and each takes ~10-15 min of Claude compute, Little's Law says L = (8/300s) × 750s ≈ 20 sources in-flight at steady state. With 6 workers, each handles ~3.3 sources concurrently — which means we need the workers to pipeline or we'll have queue buildup.
 
 More practically: λ = average sources per second, W = average extraction time. Total workers needed ≥ λ × W. This gives us the minimum worker floor. The square-root staffing rule gives us the safety margin above that floor.
+
+
+## Key Facts
+- Little's Law formula: L = λW (average items in system = arrival rate × average time per item)
+- Capacity planning rearrangement: total workers ≥ (arrival rate)(average processing time)
+- Example calculation: 1000 req/s × 0.34s = 340 concurrent requests minimum