http://home.wlu.edu/~whaleyt/classes/parallel/topics/amdahl....
I should have referenced Amdahl's law in the previous post but didn't want to misspell it and bother to look it up.
*Infinite numbers exist of both parallel and serial computing requirements. Practically there will almost always be additional cost in parallel implementation even if the extra is insignificant such as higher start up cost and coordination for shutdown.
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.
To use another car analogy. Counting clock speed is like counting the cars max RPM instead of actually measuring the performance. And then they have totalled the max RPM figures as if they have have 90,000RPM engine.