/mobile Handheld Friendly website

vs

 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
 regex-dna±±1/4
 reverse-complement±±±
 pidigits± ±
 mandelbrot± 1/3
 binary-trees±±±
 spectral-norm± ±
 n-body± ±
 fasta ±
 k-nucleotide14×1/4
 fannkuch-redux ±
 Racket used what fraction? used how many times more? 
Time-used  |-  |---  25% median  75%  ---|  -|
(Elapsed secs)±±±±

± 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
 regex-dna 
Racket39.8839.91642,384527  0% 0% 1% 100%
Lisp SBCL43.0343.06933,4841948  0% 1% 1% 100%
 reverse-complement 
Racket4.504.51171,8001026  1% 1% 1% 100%
Lisp SBCL4.304.30224,968896  0% 1% 1% 100%
 pidigits 
Racket3.083.0918,4601122  0% 2% 1% 100%
Lisp SBCL2.772.774,6441073  0% 0% 1% 100%
 mandelbrot 
Racket76.7676.7917,632797  0% 0% 1% 100%
Lisp SBCL66.9066.9235,1642459  0% 0% 1% 100%
 binary-trees 
Racket27.1427.18218,080640  1% 1% 1% 100%
Lisp SBCL19.1219.15177,812649  0% 1% 0% 100%
 spectral-norm 
Racket23.0823.0919,560627  0% 0% 1% 100%
Lisp SBCL15.7115.724,616906  0% 1% 1% 100%
 n-body 
Racket56.0256.0517,7081689  0% 0% 1% 100%
Lisp SBCL37.5537.563,9441398  0% 0% 0% 100%
 fasta 
Racket13.8913.8917,6561276  1% 0% 0% 100%
Lisp SBCL8.008.004,1321751  0% 0% 1% 100%
 k-nucleotide 
Racket208.22208.501,419,664542  0% 1% 1% 100%
Lisp SBCL72.7572.81104,2082272  0% 1% 1% 100%
 fannkuch-redux 
Racket302.66302.7416,856903  0% 1% 1% 100%
Lisp SBCL57.8457.8620,716674  0% 0% 1% 100%
 fasta-redux 
No program
Lisp SBCL0.110.11?2005  0% 0% 0% 100%

 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