Author: David Blackman
Date: 16:46:59 12/09/97
Go up one level in this thread
On December 09, 1997 at 16:33:56, Robert Hyatt wrote: >The main other approach is to use "buckets"... Ie something >like set-associative cache, where you hash to a set of entries, >and replace the set entry that is least useful. > >The drawback to this, is that the PC has a limited memory >bandwidth, and trying to fetch several hash entries at one >time overloads this and causes a bottleneck. I suspect it would be worth having a bucket exactly the same size as a cache line, ie. 32 bytes for most PCs. That's probably 2 or four table entries for most programs. You would also want to make sure your buckets were properly aligned on a cache line boundary. The idea is that the CPU will always load or store that much into first level cache anyway, so it doesn't hurt much to access it all. I haven't tried this yet as there are other more urgent things to do in my program.
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.