÷

 Step 1 : Are the Dylan Gwydion programs faster? At a glance.

This chart shows 3 comparisons - Time-used, Memory-used and Code-used.

Each chart bar shows, for one unidentified benchmark, how much the fastest Dylan Gwydion program used compared to the fastest Java 6 -server program.


 Step 2 : Are the Dylan Gwydion programs faster? Approximately.

This table shows 3 comparisons - Time-used, Memory-used and Code-used.

Each table row shows, for one named benchmark, how much the fastest Dylan Gwydion program used compared to the fastest Java 6 -server program.

 Dylan Gwydion used what fraction? used how many times more? 
Benchmark Time Memory Code Reduced N
 n-body±1/5±
 binary-trees±±±
 recursive5×1/4± 7

± read the measurements and then read the program source code.

 Step 3 : Are the Dylan Gwydion programs faster? Measurements.

This table shows 5 measurements - CPU Time, Elapsed Time, Memory, Code and ~ CPU Load.

For each named benchmark, measurements of the fastest Dylan Gwydion program are shown for comparison against measurements of the fastest Java 6 -server program.

Program Source Code CPU secs Elapsed secs Memory KB Code B ~ CPU Load
 n-body 
Dylan Gwydion24.372,2681543  
Java 6 -server27.5410,8881430  
 binary-trees 
Dylan Gwydion6.8322,232601  
Java 6 -server7.5624,012603  
 recursive N = 7 reduced workload 
Dylan Gwydion3.482,612615  
Java 6 -server0.689,652427  
 fasta
Dylan GwydionFailed
 k-nucleotide
Dylan GwydionFailed
 mandelbrot
Dylan GwydionFailed
 nsieve
Dylan GwydionFailed
 nsieve-bits
Dylan GwydionFailed
 partial-sums
Dylan GwydionFailed
 pidigits
Dylan GwydionFailed
 spectral-norm
Dylan GwydionFailed
 sum-file
Dylan GwydionFailed
 chameneos-redux
   No program
 fannkuch
   No program
 regex-dna
   No program
 reverse-complement
   No program

 Measurements for all the accepted programs

 Dylan Gwydion : multi-method oo programming 

Home Page: http://www.gwydiondylan.org

Download: http://www.gwydiondylan.org/download.html

Revised BSD license