Author: Sven Reichard
Date: 14:05:08 05/23/02
Go up one level in this thread
On May 23, 2002 at 16:40:53, Robert Hyatt wrote: > >Note that if you optimize, the compiler might take that for loop and throw >it totally away. If I is global, it could replace the for loop with a simple >i=10000; and then return. > >If you don't do any optimizing, then that loop will still probably execute >inside the resolution of the cpu clock (18ms roughly) which will screw up the >timing. You need to profile something that runs for a long time... say a >minute. When I do profile-based optimizing, I run the profile test for at >least 10 minutes over a set of positions, then use the profiling result to >re-compile... I understand that. This program was written to demonstrate what happens. The same thing happens if I search, say, winatchess.fin for 30 seconds per position, only that the profile contains about 2000 more functions, each being called thousands of times, and none using any time at all (except for something like chunk_alloc, which takes 1/100 of a second. Sven
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.