1 : Are the Racket programs faster? At a glance.

Each chart bar shows, for one unidentified benchmark, how much the fastest Racket program used compared to the fastest Lisp SBCL program.

(Memory use is only compared for tasks that require memory to be allocated.)


These are not the only compilers and interpreters. These are not the only programs that could be written. These are not the only tasks that could be solved. These are just 10 tiny examples.

 2 : Are the Racket programs faster? Approximately.

Each table row shows, for one named benchmark, how much the fastest Racket program used compared to the fastest Lisp SBCL program.

(Memory use is only compared for tasks that require memory to be allocated.)

 Racket used what fraction? used how many times more? 
Benchmark Time Memory Code
 pidigits± ±
 spectral-norm± ±
 binary-trees±±
 regex-dna †±1/4
 reverse-complement1/2±
 n-body ±
 fasta ±
 mandelbrot 1/3
 k-nucleotide1/3
 fannkuch-redux ±
 Racket used what fraction? used how many times more? 
Time-used  |-  |---  25% median  75%  ---|  -|
(Elapsed secs)±±

† possible mismatch - one-core program compared to multi-core program.

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

 3 : Are the Racket programs faster? Measurements.

These are not the only tasks that could be solved. These are just 10 tiny examples. These are not the only compilers and interpreters. These are not the only programs that could be written.

For each named benchmark, measurements of the fastest Racket program are shown for comparison against measurements of the fastest Lisp SBCL program.

Program Source Code CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
 pidigits 
Racket2.342.3425,6481122  0% 1% 0% 100%
Lisp SBCL2.372.3711,0281073  9% 91% 1% 0%
 spectral-norm 
Racket20.665.4126,372627  95% 95% 98% 95%
Lisp SBCL15.924.1421,012906  96% 97% 97% 96%
 binary-trees 
Racket39.7339.78396,888640  1% 0% 100% 1%
Lisp SBCL23.9624.00287,440649  100% 1% 1% 0%
 regex-dna 
Racket40.0740.07720,060527  0% 1% 100% 0% †
Lisp SBCL44.5820.92605,5041948  43% 42% 86% 43% †
 reverse-complement 
Racket4.364.36171,3081026  0% 1% 100% 1%
Lisp SBCL2.262.26291,560896  1% 0% 100% 0%
 n-body 
Racket53.7753.7925,7321689  0% 0% 100% 0%
Lisp SBCL26.9826.9910,6641398  1% 0% 100% 1%
 fasta 
Racket17.2217.2224,5841276  0% 0% 1% 100%
Lisp SBCL7.797.808,8601751  1% 1% 0% 100%
 mandelbrot 
Racket71.6118.1160,436796  99% 99% 100% 99%
Lisp SBCL28.537.8359,8402459  100% 84% 99% 83%
 k-nucleotide 
Racket106.84106.83387,480881  0% 0% 1% 100%
Lisp SBCL33.0833.12152,1802272  1% 1% 1% 100%
 fannkuch-redux 
Racket286.8072.7320,6761096  100% 95% 100% 100%
Lisp SBCL64.6116.6131,6441518  99% 98% 92% 100%
 fasta-redux 
No program
Lisp SBCL0.080.08?2005  0% 89% 0% 11%

† possible mismatch - one-core program compared to multi-core program.

 4 : Are there other Racket programs for these benchmarks?

Remember - those are just the fastest Racket and Lisp SBCL programs measured on this OS/machine. Check if there are other implementations of these benchmark programs for Racket.

Maybe one of those other Racket programs is fastest on a different OS/machine.

 5 : Are there other faster programs for these benchmarks?

Remember - those are just the fastest Racket and Lisp SBCL programs measured on this OS/machine. Check if there are faster implementations of these benchmark programs for other programming languages.

Maybe one of those other programs is fastest on a different OS/machine.

 Racket : statically-scoped properly tail-recursive dialect of lisp 

Welcome to Racket v6.0.

Home Page: Racket

Download: Racket v6.0 (February 2014)

Revised BSD license

  Home   Conclusions   License   Play