Skip to content
GIRIVON
Infrastructure+
Systems+
Components+
Computing Devices+
Solutions+
Compute Tools+
Knowledge+

Parallel Computing & Cluster Scaling Estimator

Predict how a job scales with more cores or nodes: fixed-size speedup with Amdahl's law, scaled speedup with Gustafson's law, and parallel efficiency, given the fraction of work that parallelises.

Results

Amdahl speedup on 64
15.42×
Parallel efficiency
24.1%
Gustafson scaled speedup
60.8×
Maximum speedup (infinite processors)
20×
Run time on 64
6.5 h
Scaling by processor count
ProcessorsAmdahl speedupEfficiencyGustafsonRun time
11100%14.2 days
21.995.2%22.2 days
43.4887%3.828.8 h
85.9374.1%7.616.9 h
169.1457.1%15.310.9 h
3212.5539.2%30.58 h
6415.4224.1%60.86.5 h

Communication, load imbalance and memory contention reduce real scaling below Amdahl's prediction.

What it calculates

  • Amdahl speedup
  • Gustafson scaled speedup
  • Parallel efficiency
  • Maximum possible speedup
  • Scaling table

Worked example

Using the default inputs below; change any input above to recalculate.

Inputs
Parallel fraction of the work95 %
Processors (cores or nodes)64
Run time on one processor (optional)100 hours
Results
Amdahl speedup on 6415.42×theoretical
Parallel efficiency24.1%theoretical
Gustafson scaled speedup60.8×theoretical
Maximum speedup (infinite processors)20×theoretical
Run time on 646.5 hestimated

Methodology

Amdahl's law gives the speedup of a fixed-size problem when a fraction p parallelises perfectly. Gustafson's law gives the scaled speedup when the problem grows with the processor count.

Formulas

Amdahl
S(n) = 1 ÷ ((1 − p) + p ÷ n)
Gustafson
S(n) = n − (1 − p)(n − 1)
Efficiency
E = S(n) ÷ n

Assumptions

  • The parallel part divides perfectly; overheads are not modelled.

Limitations

  • Measure p from profiles or from timings at two processor counts for real predictions.