Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Computer(CPU)benchmark for chessprograms

Author: Detlef Pordzik

Date: 13:21:19 01/17/98

Go up one level in this thread


On January 17, 1998 at 16:09:36, Bert  wrote:

>Yes, if your hash table is too large, you will get to hear a lot of disk
>seeks, not just on the first move out of book, but very often
>thereafter.  When correctly sized, you should hear a lot of seeks on the
>first move of the first game out of book, and nothing more after that.
>
>Here is the formula that ChessBase supplies for Fritz 5 to help
>calculate hash table size:
>
>     HT(KB)=2.0*Pfreq(mhz)*t(s)
>
>HT is the hash table size.
>
>Pfreq(mhz) is the clock speed of the processor in mhz.
>
>t is the time available per move in seconds.
>
>They give the example of a tournament with an average of 3 minutes per
>move on a Pentium 200, which requires a HT size of 72mb.

Yes, I know, Bert.
G5 + the GM books, for example, using 30 MB hash on a 128 MB W95a
system, starts
with disc seeks for about 10-20 seconds, astonishingly, as well.
Then it's over for good.

In case of the F5 formula - which I know, of course, I must say that
I've never heard or met such a behaviour, let's name it very uncommon -
to stay polite.
                                  I really don't know how many users can
follow
this - requested - idea, even in times of rapidly lowering hash
prices....

keep on rockin'



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.