Author: Sune Fischer
Date: 02:25:35 08/25/03
Go up one level in this thread
On August 24, 2003 at 21:53:55, Robert Hyatt wrote: >>>That is a reasonable rate for a program that searches 1M nodes per second. I'm >>>going at 2.4M so make that about once every 400 nanoseconds. :) Suddenly it >>>begins to add up in a big way. :) >>> >> >>Ehh, if you search 2.4 Mnodes on a dual that's 1.2 nodes on a single (one every >>800 ns), I'd say not very far from 1M. I assume you will also have _two_ chips >>to do the copying :) > >_no_. You have exactly _one_ bus connecting _both_ processors to memory. > >That's a problem... What has the bus to do with cache to cache copying? Each thread would copy to it's own stack, which I presume would reside in the cache on each respective chip. Otherwise you're right it would be dead slow, but then that would be the same for all kinds of tables which I certainly hope isn't the case. -S.
This page took 0.06 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.