Step 1 : Are the 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 program used compared to the fastest program.
Step 2 : Are the 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 program used compared to the fastest program.
| used what fraction? used how many times more? | ||||
|---|---|---|---|---|
| Benchmark | Time | Memory | Code | Reduced N |
± read the measurements and then read the program source code.
Step 3 : Are the 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 program are shown for comparison against measurements of the fastest program.
| Program Source Code | CPU secs | Elapsed secs | Memory KB | Code B | ~ CPU Load |
|---|---|---|---|---|---|
| binary-trees | |||||
| chameneos-redux | |||||
| fannkuch | |||||
| fasta | |||||
| k-nucleotide | |||||
| mandelbrot | |||||
| n-body | |||||
| pidigits | |||||
| regex-dna | |||||
| reverse-complement | |||||
| spectral-norm | |||||
Measurements for all the accepted programs
:
Groovy Version: 1.6.0 JVM: 1.6.0_10
Home Page: http://groovy.codehaus.org/
Download: http://groovy.codehaus.org/