Gustafson and Barsis pointed out that Amdahl assumed a fixed input size. If instead you grow the problem size along with the number of processors, the speedup from parallelism grows indefinitely. Of course, like Amdahl, they assume perfect load balancing and don't factor in communication overhead. But parallel still beats the pants off of serial if we want to keep solving larger and larger problems.
http://en.wikipedia.org/wiki/Gustafson%27s_Law
Gustafson and Barsis pointed out that Amdahl assumed a fixed input size. If instead you grow the problem size along with the number of processors, the speedup from parallelism grows indefinitely. Of course, like Amdahl, they assume perfect load balancing and don't factor in communication overhead. But parallel still beats the pants off of serial if we want to keep solving larger and larger problems.