On May 28, 4:19*pm, FromTheRafters <erra...@nomail.afraid.org> wrote:
> You may find this of interest if you haven't read it already.
>
> http://www.intel.com/intelpress/samp...samplech01.pdf
Just read it, thanks. Amdahl's law was interesting, as well as the
below passage. Regarding the below passage, this is very true in
searching the chess tree in a chess playing software for example. You
don't 'solve' for the 'best' move any faster with parallel processing
and multiple cores, but you get a higher quality 'best' move, since in
a given tree your search, when using multiple cores, is deeper than
with a single core, and hence your 'quality' of 'best' move (which is
never known to be 100% certain to be the best move) goes up.
RL
Perhaps the biggest weakness, however, is the assumption that
Amdahl’s Law makes about the problem size. Amdahl’s Law assumes that
as the number of processor cores increases, the problem size stays the
same. In most cases, this is not valid. Generally speaking, when given
more computing resources, the problem generally grows to meet the
resources available. In fact, it is more often the case that the run
time of
the application is constant.