How many processors are worth adding?
Speeding up one part of a job leaves the untouched part as a bottleneck.
Inside this model
Speedup with n processors is 1/[(1−p)+p/n], where p is the parallelizable share. The plot shows speedup for 1–32 processors at the selected share.
Out in the world
A practical use
Estimate whether parallelizing a slow data task will justify more servers.
A useful lens. Not a universal law.
- Coordination overhead and changing workload are excluded, so real gains can be smaller.
Associated thinkers
Further reading
Explore the original research or the teaching reference behind this experiment.
Gene Amdahl — Validity of the Single Processor Approach ↗