Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Parallel search article RBF

Author: Dann Corbit

Date: 12:27:32 09/11/02

Go up one level in this thread


On September 11, 2002 at 15:10:49, Gian-Carlo Pascutto wrote:
[snip]
>>2.  That there is definitely a linear improvement in new CPUs and 64 CPUs is
>>almost exactly twice as good as 32 CPUs.  I think that is pretty astonishing,
>>and so however it is that communication happens between nodes should be tried
>>in other systems.
>
>It's a natural consequence of the fact that they have (almost) no
>synchronisation costs.

Well, that's pretty interesting, isn't it?  Can the same model be copied to
other algorithms?

Surely they have to coordinate the information from the entire set of processors
somehow.  The processors cannot be purely independent of one another or no
resolution would be reached.  If a similar speedup could be obtained with
another scheme, it might be very valuable.

Also, since they have done a test with 64 CPUs, I assume that they are using
some sort of NUMA architecture, since there are not many 64 CPU SMP systems
around.  Hence, it might scale to stupendous CPU counts like the DoD
supercomputers with thousands of CPUs.  If if the efficiency is 1%, if you have
10000 CPUs you will be at 100x the speed of a single CPU system.  Maybe no other
system can match that.



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.