Does adding processors help? It depends on whether the problem is fixed or grows with the machine. The Gustafson law calculator gives the scaled speedup S = N − s(N − 1) from the serial fraction and the number of processors, and compares it with the Amdahl speedup of a fixed problem.
How the calculation works
- Enter the serial fraction s: the share of the run time, measured on the parallel machine, that cannot be parallelized.
- Enter the number of processors N (cores, nodes or GPUs).
- The calculator applies Gustafson’s law: S = N − s × (N − 1), which lets the problem grow with the machine.
- For comparison, it gives Amdahl’s speedup for a fixed-size problem with the same serial share, and the limit 1 / s.
Example
A program spends 5 % of its time in serial code on 64 processors. With the problem scaled to the machine, the speedup is 64 − 0.05 × 63 = 60.85, an efficiency of 95.1 %. The same serial share on a fixed problem gives only 15.42 (Amdahl), and the limit for any number of processors is 20.
Why it matters
The calculator helps students and engineers in high-performance computing to understand scaling, to plan a cluster or a GPU run and to explain why weak scaling can be good when strong scaling is poor. It helps to set realistic goals for a parallel program.
Good to know
Gustafson’s law is an idealization: the serial part is taken as constant in time and the parallel part as perfectly scalable. Real programs have overhead of communication and synchronization that grows with the number of processors. The serial fraction must be measured on the parallel run. The result is an upper bound on what is possible, and it is not a prediction of the speedup of your code.
Related tools
The Amdahl’s law calculator gives the limit for a fixed problem, the server capacity calculator sizes the machines for a load, the CPU dynamic power calculator estimates the power of a processor, and the queue wait time calculator covers waiting lines for jobs.