Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Data on hash table probing and memory bandwidth

Author: Miguel A. Ballicora

Date: 13:03:11 12/16/02

Go up one level in this thread


On December 16, 2002 at 14:51:18, Robert Hyatt wrote:

>On December 16, 2002 at 13:32:46, Dieter Buerssner wrote:
>
>>I did similar tests. IIRC, I got differences of > 5% faster for, what you called
>>"new". I unfortunately do not have the code for the "old" (2 different tables)
>>handy anymore, to recheck. You are not probing in quiescence search, so it is
>>reasonable to expect, that your differences are smaller.
>>
>>Anyway, for a very small code change (I would guess not more than 1 hour),
>>getting 5% is not so bad.
>>
>>Regards,
>>Dieter
>
>
>No, although for me it was 2% which is not so hot...
>
>I will probably stick with it since it is done, of course....

Did you make sure that your table is aligned avery 16 bytes and not 8, for
instance?

Miguel




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.