Author: Dan Andersson
Date: 02:58:01 08/30/01
Go up one level in this thread
One really simple parallel search algorithm is to have two searches working independently. Only one search communicate with the output. But both share the same hash table and thus work together. If you are lucky, that can result in a good speedup. To increase the efficience of this algorithm, use ETC to get better use of the hash table, this won't strain bandwidth in the bulk of the search. MvH Dan Andersson
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.