University at Buffalo
The State University of
New York
CCR
Center for Computational Research
Amdahl’s Law Example
n
Serial Program
q
t
A
= 2 minutes, t
B
= 98 minutes
m
t
serial
= t
A
+ t
B
= 100 minutes
n
Parallel Implementation
q
Parallelize step B
m
t
parallel
= t
A
+ t
B
/N
n
Speedup
q
S = 100 min/ (2 min + 98 min/N)
Observed Speedup
N
S
ideal
S
obs
1
1
1
2
2
2
10
10
8
50
50
25
100
100
34
1000
1000
48