Author: David Blackman
Date: 02:07:52 09/16/99
Go up one level in this thread
On September 15, 1999 at 09:00:08, Robert Hyatt wrote: >But it is improving bit by bit. Tim Mann suggested a new hashing scheme that >is cute for SMP users, as it effectively eliminates the Lock()/UnLock() calls >without the danger of incorrect hash results. This is not at all difficult and i'm pretty sure a few programs have been doing it for years. It get's a bit harder if you rely on the (shared) hash table to do detection of repetitions, or to count how many CPUs are currently active below a given node (some parallel algorithms rely on knowing this). But then, lock/unlock are not extremely slow on most modern hardware if you use inline assembler and avoid using system calls. Maybe a problem for the fast/dumb brigade.
This page took 0.01 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.