Author: Dieter Buerssner
Date: 14:37:41 05/30/04
Go up one level in this thread
On May 30, 2004 at 16:15:54, Robert Hyatt wrote: >I have no idea what your program above does [, and really don't care.] You could have an idea. I showed the source here, and we discussed it. http://chessprogramming.org/cccsearch/ccc.php?find_thread=306858 It tries to answer the question: How long do I need on average, to access a random word in memory - from programmers point of view. I have a large array of words, and need to know the value at one random index (a situation very comparable to hashing in chess). The program does not care about how many TLB read are needed - just the time until it will have the value (say in a register). It is the time of one move instruction movl (%eax), %eax or in Intel syntax mov eax, DWORD PTR [eax] where, before the instruction eax points to some (valid) word (correctly aligned for a pointer), randomly. Regards, Dieter
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.