Author: Dan Andersson
Date: 08:02:49 03/28/01
Go up one level in this thread
I'm still a bit woozy from the flu, but I think that if the four processors/treads have a non uniform memory access pattern there might be a speedup due to interleaving. For example if two processes are accessing hash tables while the two others run a search entirely from the cashe. I have experimented with a teoretically sound pruning method that might have this property in paralell search especially nearer to the leaves. Sorry if this is totally bad thinking, the thermometer reads 38.1 degrees Celsius. Regards 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.