Author: Peter Kappler
Date: 14:02:36 07/20/00
Go up one level in this thread
On July 20, 2000 at 14:56:39, Ralf Elvsén wrote: >On July 20, 2000 at 12:15:49, Peter Kappler wrote: > >>On July 20, 2000 at 05:47:34, Ralf Elvsén wrote: >> > >>> >>>Lately I have begun to suspect that the try/catch statements >>>in my Javacode was partly responsible for the preformance. >>>Do you know if this is true? Can you guesstimate other pitfalls >>>for an unexperienced Java-chess programmer? >>> >> >>I'm not sure about the try/catch overhead. > >Ok, I'll have to look into it myself sometime. My program is full >of that. It's a blessing for the debugging. > >>The only thing I absolutely avoid is creating any new objects while the search >is executing. > >Yes, no objects were created after the search started. I did create >one or two simple objects for a while, to hold integers, at each node but I >immediately noticed the overhead and removed it. > >>Also, what VM/JIT are you using? IBMs is the fastest. >> >It was all free stuff from Sun. Java 2.something and their >Hotspot compilator. I figured IBMs wouldn't be THAT much better and >was looking for the more serious bottlenecks first. Hotspot is pretty good, but I think the IBM JIT is ~10-15% faster. Have you tried the profiler that comes with Sun's JDK? It's not too bad. --Peter
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.