Author: Robert Hyatt
Date: 17:35:24 10/24/03
Go up one level in this thread
On October 24, 2003 at 15:45:31, Gian-Carlo Pascutto wrote: >On October 24, 2003 at 15:16:24, Omid David Tabibi wrote: > >>No threads?! How do you conduct parallel search then (if I may ask)? > >Multiprocessing + shared memory > >-- >GCP IE fork() + either mmap() or shmget()/shmat(). It has some drawbacks. Eugene's probe code is threaded. Not using threads hurts there, as you don't get the LRU buffer management efficiency in the egtb cache. It might help marginally on a NUMA box to have separate copies of the code/read-only data on each processor's local memory (Eugene doesn't think this is much of a factor however, due to cache sizes on larger NUMA boxes).
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.