Author: Sune Fischer
Date: 05:57:14 10/04/03
Go up one level in this thread
On October 04, 2003 at 07:57:13, Dan Andersson wrote: > If you are able to do N probes in parallel without latency penalties that in >itself means that there is an inefficiency. To be able to do that you will have >to have local TTs. And those have less global search information. > >MvH Dan Andersson Are you saying that running two threads will double the latency for each thread, and running N threads increase latency by a factor N? Do they get queued or something? That would make it almost impossible to program for, not knowing the latency of a probe. -S.
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.