Author: Sean Mintz
Date: 17:40:51 12/07/03
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
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.