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

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 : Approximately - Are the Racket programs faster?

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
 mandelbrot± 1/3
 pidigits± ±
 reverse-complement±±±
 n-body± ±
 spectral-norm± ±
 binary-trees±
 fasta ±
 regex-dna †±1/4
 k-nucleotide12×1/4
 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 : Measurements - Are the Racket programs faster?

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
 mandelbrot 
Racket78.1019.7355,048796  99% 100% 99% 99%
Lisp SBCL80.2522.2956,0002459  98% 82% 100% 82%
 pidigits 
Racket3.053.0620,0921122  1% 100% 0% 0%
Lisp SBCL2.772.788,4961073  2% 0% 0% 100%
 reverse-complement 
Racket4.494.49172,2761026  1% 100% 0% 1%
Lisp SBCL3.223.23209,500896  1% 1% 100% 0%
 n-body 
Racket55.3255.3320,9281689  1% 43% 58% 0%
Lisp SBCL38.4138.437,8521398  0% 1% 100% 0%
 spectral-norm 
Racket22.945.9921,612627  96% 95% 95% 97%
Lisp SBCL15.944.1317,772906  96% 97% 97% 97%
 binary-trees 
Racket27.2427.27255,740640  0% 0% 1% 100%
Lisp SBCL17.3417.37148,988649  0% 32% 1% 69%
 fasta 
Racket13.4213.4319,6481276  0% 0% 1% 100%
Lisp SBCL7.867.867,8361751  0% 0% 100% 1%
 regex-dna 
Racket39.5339.52669,152527  1% 100% 1% 1% †
Lisp SBCL43.8220.93581,1641948  44% 41% 89% 37% †
 k-nucleotide 
Racket206.91206.991,421,872542  87% 4% 11% 1%
Lisp SBCL67.3667.43114,5082272  0% 0% 100% 1%
 fannkuch-redux 
Racket328.2683.6318,3761096  97% 99% 98% 100%
Lisp SBCL61.3815.7925,4961518  95% 98% 98% 99%
 fasta-redux 
No program
Lisp SBCL0.100.11?2005  0% 0% 91% 0%

† 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.1.1.

Home Page: Racket

Download: Version 6.1.1 (November 2014)

Revised BSD license

  Home   Conclusions   License   Play