Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: hash table size - is a power of 2 still an advantage these days?

Author: Robert Hyatt

Date: 19:30:03 09/27/03

Go up one level in this thread


On September 25, 2003 at 22:12:24, Pham Hong Nguyen wrote:

>On September 25, 2003 at 11:30:06, Robert Hyatt wrote:
>
>>On September 24, 2003 at 21:18:02, Pham Hong Nguyen wrote:
>>
>>>>I try to use _most_ of main memory for serious games, and if you have a
>>>>1 gig machine, I generally use something like hash=784M, hashp=40M,
>>>>cache=128M, and go from there...
>>>
>>>Just a curious question: what is cache of Crafty? (or how do you use it?). Many
>>>thanks.
>>
>>
>>It is a standard part of Eugene's egtb.cpp code.  It is used for a big chain
>>of buffers for egtb I/O, maintained in LRU order.  It reduces real I/O to
>>endgame tables.
>
>Thanks for your answer. It is quite useful for me because I have been working on
>EGTB. I would like to ask another question (before looking to Eugene code): do
>you use whole cache (128M) for current using table (it means only one table) or
>do you divide that cache into small equal parts for all tables you have (say 10
>tables, each uses only 12M), or other way to use?


It's pure LRU.  If you are probing just one table most of the time, that
will dominate the cache blocks.  If you are probing many tables, then they
all share the cache.  There are no fixed "partitions" or anything in the
cache.



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.