Author: Dan Andersson
Date: 18:13:25 01/06/03
Go up one level in this thread
The claim of C like performance is largely unfounded. It is seen under relatively restricted conditions. Most often programs dominated by short inner loops. And even then only when the bytecode has not removed too much information from the original program as to perform additional optimization passes. The bytecode is too coarse grained. And tend to destroy a lot of useful information that is possible to glean from the sources. MvH Dan Andersson
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.