Author: Robert Hyatt
Date: 20:00:10 12/07/03
Go up one level in this thread
On December 07, 2003 at 20:40:51, Sean Mintz wrote: >Discussions about running chess programs efficiently on clusters have been going >on here for as long as I can remember. With the recent (impressive!) work by >Hyatt and Nalimov, I wonder if this brings us any closer towards efficient >searches by clusters. Although there are many major differences left, NUMA >seems to me much closer to clusters than SMP. Are we getting closer, or are the >differences still to great/many? > >Sean Mintz Still a long way apart. NUMA is _still_ shared memory. Clusters are still message-passing. Handling NUMA is just a special-case of shared memory stuff that simply offers more performance if done right...
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.