Amdahl’s Law
Amdahl’s Law describes how the speedup from optimizing or parallelizing a computation is limited by the fraction that remains sequential or unoptimized.
Grokking Concurrency
Amdahl's law is a formula for estimating the maximum speedup of a computation from its sequential fraction and available processing resources.
- How it is used
- Estimates whether parallelizing a program is worthwhile by comparing sequential work with independently executable parallel work.
- How deep it goes
- Explains the speedup limit through a timed card-search example, stopping short of detailed formula derivation or implementation.
- Examples
- Uses a mother-and-baby analogy and a timed index-card search divided among friends.
- What you can do after
- Evaluate expected parallelization benefits before redesigning an algorithm for multiple processing resources.
Learn Concurrent Programming with Go
A performance model stating that the overall speedup from optimizing or parallelizing a system is limited by the fraction of execution that remains sequential.
- How it is used
- Guides decisions about whether optimizing or parallelizing a workload can deliver meaningful performance gains.
- How deep it goes
- Defines sequential bottlenecks and illustrates speedup limits with construction scenarios and a processor-scaling figure, without deriving the formula.
- Examples
- Uses house construction, a narrow transport route, processor-count charts, and a 95%-parallel workload reaching roughly 19-fold speedup.
- What you can do after
- Evaluate scalability limits and choose whether additional parallel resources are likely to improve a fixed-size workload.
Read how Learn Concurrent Programming with Go explains Amdahl’s Law →
Grokking GPU Programming
Amdahl’s Law models the maximum speedup obtainable when the problem size is fixed and a fraction of the work remains sequential.
- How it is used
- Estimates the fixed-size speedup ceiling imposed by sequential work before parallelizing.
- How deep it goes
- Defines the speedup formula and works through numerical limits without deriving the formula.
- Examples
- Uses a program with 10% sequential work to compare speedups across processor counts.
- What you can do after
- Evaluate whether parallelization is worthwhile by estimating speedup from the sequential fraction and processor count.
Latency
Amdahl's law is a performance model that estimates the maximum speedup from parallelizing a fixed-size computation according to its parallelizable fraction and number of execution units.
- How it is used
- Guides latency design by estimating how much parallel processing can accelerate a fixed-size computation.
- How deep it goes
- Defines theoretical speedup, applies it to an endpoint, and stops short of replacing empirical latency measurement.
- Examples
- Uses an order-processing endpoint, a 5/15/30 ms timing breakdown, and speedup curves across parallelizable fractions.
- What you can do after
- Evaluate parallelization limits and validate latency assumptions through controlled measurement.
Also covered in
What to know first
- parallelismParallelism is the execution of multiple independent tasks or computational operations at the same time rather than sequentially.
- concurrencyConcurrency is the structuring or execution of multiple computational activities so their progress overlaps in time, whether or not they run simultaneously.
- meanThe mean is a measure of central location equal to the arithmetic average of numerical observations, or the probability-weighted average of a random variable’s possible values.
Related concepts
- Gustafson's lawcontrasts with · Gustafson's law models parallel speedup when problem size grows with processing resources, making fixed sequential work a smaller proportion of total work.
- speedupmeasures · Speedup is the ratio of the execution time for a baseline computation to the execution time for an alternative implementation of the same computation.
- parallelismuses · Parallelism is the execution of multiple independent tasks or computational operations at the same time rather than sequentially.
- meanuses · The mean is a measure of central location equal to the arithmetic average of numerical observations, or the probability-weighted average of a random variable’s possible values.
Questions about Amdahl’s Law
What is Amdahl’s Law?
Amdahl’s Law describes how the speedup from optimizing or parallelizing a computation is limited by the fraction that remains sequential or unoptimized.
Which Manning books explain Amdahl’s Law?
Grokking Concurrency, Learn Concurrent Programming with Go, Grokking GPU Programming and Latency.
What should I know before learning Amdahl’s Law?
Manning books that teach Amdahl’s Law usually introduce parallelism, concurrency and mean first.
What is the difference between Amdahl’s Law and Gustafson's law?
Amdahl’s Law describes how the speedup from optimizing or parallelizing a computation is limited by the fraction that remains sequential or unoptimized. Gustafson's law models parallel speedup when problem size grows with processing resources, making fixed sequential work a smaller proportion of total work.
These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.



