Author: Dann Corbit
Date: 16:32:04 05/15/02
Go up one level in this thread
On May 15, 2002 at 17:24:41, Gareth McCaughan wrote: >On May 15, 2002 at 11:52:52, Dann Corbit wrote: > >> Actually not. I assumed he was talking about a combination of global >> optimization together with optimal reordering of the objects to minimize jump >> distance [at compile time and then at link time]. >> >> I have no idea why rewriting the code at runtime would be an advantage. >> Undoubtably, I simply do not understand the message that I responded to. > >Same principle as profile-driven optimization, only more so. >Track which way jumps go and arrange code accordingly to >minimize cache misses and pipeline stalls. That's profile guided optimization in C++ land. I find it hard to imagine that doing it on the fly would be faster than profile guided data, but I often lack imagination.
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.