Author: Vincent Diepeveen
Date: 19:49:49 09/11/01
Go up one level in this thread
On September 10, 2001 at 18:13:51, Dan Andersson wrote: >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 Unless that 'lineair speedup' is like 0.01 or something so very small i don't believe a word of it for computerchess. We search that deeply nowadays that getting a good speedup at a cluster is nearly impossible. I do not know of course how important hashtable is for othello and i do not know the quality of other programs you compare it with. AFAIK othello was nearly solved, is it? How would you distribute hashtable on a machine with such a slow communication speed like this machine?
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.