On Fri, Oct 16, 2009 at 10:03 AM, Sam Watkins <s...@nipl.net> wrote: > On Thu, Oct 15, 2009 at 12:50:48PM +0100, Richard Miller wrote: >> > It's easy to write good code that will take advantage of arbitrarily many >> > processors to run faster / smoother, if you have a proper language for the >> > task. >> >> ... and if you can find a way around Amdahl's law (qv). > > "The speedup of a program using multiple processors in parallel computing is > limited by the time needed for the sequential fraction of the program." > > So it would only be a problem supposing that a significant part of the program > is unparallelizable. I can think of many many tasks where "Amdahl's law" is > not going to be a problem at all, for a properly designed system.
Lets do a little math, shall we? Better yet, lets graph it: http://en.wikipedia.org/wiki/File:AmdahlsLaw.svg Now, do you see what's on the right side of X axis? That's right 65536 cores. Pause and appreciate the measeleness of speedup... Thanks, Roman.
