Search the practice set
126 questions, 454 terms and 400 topics in 20 areas.
7 results for “Little's Law”
Terminology · 3
term
Performance & Capacity
term
Connection Pooling
term
Architecture Fundamentals
Little's Law
In a stable system, the average number of items in it equals the arrival rate times the average time each spends in it — L = λW.
Little's Law Applied to Pools
Using L = λW to size connection and thread pools from measured throughput and latency rather than from a default.
Conway's Law
Systems tend to mirror the communication structure of the organisation that builds them.
Questions · 2
quiz
Bulkheads & Isolation
quiz
Performance & Capacity
A service calls four dependencies. How do you size its thread pools, and why is the total often smaller than people expect?
The sizing rule Little's Law, per dependency: concurrency = throughput to that dependency × its latency. Dependency Calls/s Latency Concurrency Pool Auth 500 10
Precompute every user's timeline at write time, or assemble it at read time? Explain why the answer for a social feed is neither.
Why each pure strategy fails Fan out on read. Store each post once; on timeline load, query the posts of everyone the user follows and merge. Writes are trivial