÷

 Are the Java 6 -server programs faster?

Do the Java 6 -server programs use optimized assembly code libraries? Are they small simple programs or very optimized programs? Do the Java 6 -server programs use a fraction of the time used by others, or do they use several times more?


 Java 6 -server used what fraction? used how many times more? 
Programs Time Memory Code Reduced N
↓ n-body1/418×±
↓ sum-file1/214×
↓ mandelbrot1/215×±
↓ spectral-norm±±
↓ recursive±11×±
↓ nsieve±±
↓ nsieve-bits±
↓ k-nucleotide±±
↓ reverse-complement±±±
↓ fannkuch±15×±
↓ regex-dna±±
↓ binary-trees±±
↓ partial-sums15×±

± look at the measurements and then look at the programs.

 Are the Java 6 -server programs faster?

Program & Logs CPU secs Elapsed secs Memory KB Code B ~ CPU Load
 n-body 
Java 6 -server14.7511,5241424  
OCaml54.006441239  
 sum-file 
Java 6 -server4.109,972226  
OCaml8.74692138  
 mandelbrot 
Java 6 -server3.2411,092623  
OCaml6.06716444  
 spectral-norm 
Java 6 -server24.0110,008514  
OCaml31.631,196369  
 recursive 
Java 6 -server6.7612,044427  
OCaml7.471,120389  
 nsieve 
Java 6 -server2.2520,592296  
OCaml2.169,380295  
 nsieve-bits 
Java 6 -server5.0413,364523  
OCaml4.415,020176  
 k-nucleotide 
Java 6 -server15.8970,9641052  
OCaml13.8334,636845  
 reverse-complement 
Java 6 -server1.3058,932592  
OCaml1.0247,244540  
 fannkuch 
Java 6 -server11.058,884555  
OCaml8.30592485  
 regex-dna 
Java 6 -server7.8175,892921  
OCaml5.5445,364615  
 binary-trees 
Java 6 -server6.8926,808603  
OCaml4.838,732469  
 partial-sums 
Java 6 -server9.158,488474  
OCaml4.64564508  
 chameneos-redux 
Java 6 -server17.5112,0921429  
No OCaml
 fasta 
Java 6 -server21.469,1841240  
No OCaml
 pidigits 
Java 6 -server1.928,992938  
No OCaml

 Java 6 -server : ubiquitous jit server virtual machine 

java version "1.6.0_07"
Java(TM) SE Runtime Environment (build 1.6.0_07-b06)
Java HotSpot(TM) Server VM (build 10.0-b23, mixed mode, sharing)

Home Page: http://java.sun.com/j2se/

Download: http://java.sun.com/j2se/downloads/

"Remember how HotSpot works. It starts by running your program with an interpreter. When it discovers that some method is "hot" -- that is, executed a lot, either because it is called a lot or because it contains loops that loop a lot -- it sends that method off to be compiled. After that one of two things will happen, either the next time the method is called the compiled version will be invoked (instead of the interpreted version) or the currently long running loop will be replaced, while still running, with the compiled method. The latter is known as "on stack replacement" and exists in the 1.3/1.4 HotSpot based systems."

Benchmarking the Java HotSpot VM

Revised BSD license