Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Huge Caches Mean Faster Chess Engines?

Author: Peter Fendrich

Date: 14:35:12 06/24/02

Go up one level in this thread


On June 24, 2002 at 13:07:11, Gian-Carlo Pascutto wrote:

>On June 24, 2002 at 10:27:05, Robert Henry Durrett wrote:
>
>>This "latency issue" is interesting.  Could you please elaborate?  How do the
>>caches help?
>
>Bandwidth = amount of data that can be transferred per second
>Latency = amount of time it takes to find something in the memory
>
>Generally, a chessprogram will need to access small amounts of
>data that are scattered randomly throughout the memory of the
>machine. Because of this, bandwidth isn't so important, because
>there is only a small amount of data, but the latency is.

I would say that chessprograms are designed like that because lack of bandwidth.
With significantly more bandwidth a lot of things could be done differently.
Peter
>
>--
>GCP





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.