Author: Dan Andersson
Date: 15:13:51 09/10/01
Go up one level in this thread
I know of at least one search method that would fit perfectly on this kind of machine. I recently had the pleasure to be able to run an old Othello program of mine on a brand new NUMA machine. Implementing a published algorithm. I was surprised to find a near linear function speedup to the number of processors close to one to one, up to all sixtyfour available. There was of course a small slowdown at each node but all in all it was a profitable tradeoff. 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.