Regarding the time used by RDTSC:
From
http://smallcode.weblogs.us/2007/12/07/performance-measurements-with-rdtsc/
Intel and Agner Fog recommend measuring the overhead
of RDTSC function and subtracting it from your result.
The overhead is relatively low (150-200 clock cycles)
and it occurs in all tested functions, so you can
neglect it when measuring long functions (e.g., 100
000 clock cycles).
NOTE: the page above recommends flushing the cache
before calling RDTSC, when using it for timing
purposes. There is probably no need to do so when
grabbing LSBs.
I wonder, however, if the LSBs would be as random as
all that, when called frequently in
quasi-deterministic code which takes a predictable
number of cycles between invocations.
Terry McIntyre <[EMAIL PROTECTED]>
Wherever is found what is called a paternal government, there is found state
education. It has been discovered that the best way to insure implicit
obedience is to commence tyranny in the nursery.
Benjamin Disraeli, Speech in the House of Commons [June 15, 1874]
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
