Computer Chess Club Archives

Search

Messages

Subject: Re: 64-bit machines

Author: Russell Reagan

Date: 18:41:08 02/09/03

Go up one level in this thread

On February 09, 2003 at 21:01:26, Tom Kerrigan wrote:

>>>Every program I know about (with the
>>>exception of HIARCS) has a working set of < 256k.

>>Code and data all fit in 256 KB? Impressive. I rarely see that even in programs
>>an order of magnitude less complex.
>>No hash tables?

>No, don't be stupid. A program's "working set" is the code/data that it accesses
>the vast majority of the time. Of course the program accesses code/data outside
>of its working set, but infrequently enough that it doesn't impact performance.

Perhaps the questions I ask are only asked out of ignorance, but how can the
hash table be considered to be used "infrequently"? Also, if you look at a
program like Crafty, it makes use of lookup tables that exceed 256kb of memory
that are used at every node (until captures). Why is this not considered to be
in the program's "working set"?

Thanks,
Russell

• Re: 64-bit machines Tom Kerrigan 19:51:25 02/09/03
  • Re: 64-bit machines Robert Hyatt 19:57:08 02/09/03
    • Re: 64-bit machines Tom Kerrigan 11:46:12 02/10/03
      • Re: 64-bit machines Robert Hyatt 13:05:23 02/10/03
    • Re: 64-bit machines Tom Kerrigan 20:36:05 02/09/03
      • Re: 64-bit machines Robert Hyatt 09:29:11 02/10/03

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.