Step 1 : Are the Lisp SBCL 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 Lisp SBCL program used compared to the fastest Java 6 -server program.
Step 2 : Are the Lisp SBCL 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 Lisp SBCL program used compared to the fastest Java 6 -server program.
| Lisp SBCL used what fraction? used how many times more? | ||||
|---|---|---|---|---|
| Benchmark | Time | Memory | Code | Reduced N |
| partial-sums | 1/3 | ± | ± | |
| reverse-complement | 1/3 | ± | ± | |
| binary-trees | 1/2 | ± | ± | |
| mandelbrot | 1/2 | ± | ± | |
| n-body | 1/2 | ± | ± | |
| recursive | ± | ± | ± | 7 |
| spectral-norm | ± | ± | ± | |
| fannkuch | ± | ± | ± | |
| nsieve-bits | ± | ± | ± | |
| nsieve | ± | 13× | ± | |
| fasta | 2× | ± | ± | |
| k-nucleotide | 2× | 1/2 | ± | |
| sum-file | 3× | ± | ± | |
| regex-dna | 4× | 6× | ± | |
| pidigits | 8× | 3× | ± | |
± read the measurements and then read the program source code.
Step 3 : Are the Lisp SBCL 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 Lisp SBCL program are shown for comparison against measurements of the fastest Java 6 -server program.
Measurements for all the accepted programs
Lisp SBCL : pioneering s-expression oriented programming
online book Practical Common Lisp
SBCL 0.9.16
Home Page: http://sbcl.sourceforge.net/
Download: http://sbcl.sourceforge.net/