Author: James Swafford
Date: 11:50:13 02/10/01
Go up one level in this thread
> >There is no reasons for compiled (as opposed to interpreted) Java to be slower >than C. The question is if the available compilers are good enough. My understanding of Java (even compiled Java) is that it is slower because it translates into more machine language instruction. For example, C does not do "garbage collection," but Java does. In other words, in C if you allocate memory to three structures, then free the middle one, there is a "whole" in memory that you can only use if you allocate memory <= the size of that whole. In Java, once you free the middle structure, it will "compact" the first and third into continous space. Nice, but costly. This may or may not hurt a chess prog, as the largest structures (hash tables) are normally allocated during initialization and freed on termination, but I suppose it depends on the program. -- James
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.