According to Amdahl's law, a program with sequential portion s, can achieve at most 1/s speedup under infinite computing resource. So clearly here, the best possible speedup is only 4X.
rrudolph
And with only six cores, the best possible speedup is 2.67
According to Amdahl's law, a program with sequential portion s, can achieve at most 1/s speedup under infinite computing resource. So clearly here, the best possible speedup is only 4X.
And with only six cores, the best possible speedup is 2.67
speedup < 1/(s + (1-s)/p), s = 0.25, p = 6