Computer Chess Club Archives




Subject: Re: Non power of two hash table sizes

Author: Robert Hyatt

Date: 11:01:28 02/19/02

Go up one level in this thread

On February 19, 2002 at 11:07:29, Gian-Carlo Pascutto wrote:

>On February 19, 2002 at 10:48:25, Robert Hyatt wrote:
>>Many newer processors do
>>the integer divide far slower than the AND I use now.
>OTOH, it is followed by an unpredictable random memory
>access, which will make the division negligible on any
>modern processor.

Again, it depends.  The procedure call often resulted in a cache miss.
Which resulted in lots of memory reads as the procedure to do the int
divide had many instructions in it.  That would (on the sparc, anyway)
bury the 16 byte memory read to grab the actual table entry.

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.