x64 Ubuntu : Intel® Q6600® one core
Computer Language Benchmarks Game      Help

- all benchmarks - binary-trees chameneos-redux fannkuch fasta k-nucleotide mandelbrot meteor-contest n-body pidigits regex-dna reverse-complement spectral-norm thread-ring - all languages - Ada 2005 GNAT ATS C GNU gcc C# Mono C++ GNU g++ Clean Erlang HiPE F# Mono Fortran Intel Go 6g 8g Haskell GHC Java 6 -server Java 6 -Xint Java 6 steady state JavaScript TraceMonkey JavaScript V8 Lisp SBCL Lua OCaml Pascal Free Pascal Perl PHP Python CPython Ruby JRuby Ruby MRI Scala Scheme PLT Smalltalk VisualWorks

÷ Ada 2005 GNAT ATS C GNU gcc C# Mono C++ GNU g++ Clean Erlang HiPE F# Mono Fortran Intel Go 6g 8g Haskell GHC Java 6 -server Java 6 -Xint Java 6 steady state JavaScript TraceMonkey JavaScript V8 Lisp SBCL Lua OCaml Pascal Free Pascal Perl PHP Python CPython Ruby JRuby Ruby MRI Scala Scheme PLT Smalltalk VisualWorks

 Step 1 : Are the Scheme PLT 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 Scheme PLT program used compared to the fastest Perl program.

 Step 2 : Are the Scheme PLT 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 Scheme PLT program used compared to the fastest Perl program.

Scheme PLT used what fraction? used how many times more?
Benchmark	Time	Memory	Code	Reduced N
binary-trees	1/19	1/2	±
mandelbrot	1/9	3×	2×
n-body	1/9	5×	±
spectral-norm	1/6	±	1/2
fasta	1/6	3×	±
fannkuch	1/5	6×	±
pidigits	1/2	4×	3×
regex-dna	±	4×	2×
k-nucleotide	±	2×	2×
reverse-complement	4×	±	2×

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

 Step 3 : Are the Scheme PLT 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 Scheme PLT program are shown for comparison against measurements of the fastest Perl program.

Program Source Code	CPU secs	Elapsed secs	Memory KB	Code B	~ CPU Load
binary-trees
Scheme PLT	80.57	80.56	452,372	503	0% 0% 0% 100%
Perl	1,490.64	1,490.58	1,091,276	541	0% 0% 0% 100%
mandelbrot
Scheme PLT	489.90	489.87	12,132	508	1% 0% 0% 100%
Perl	4,387.61	4,387.50	4,132	311	0% 0% 0% 100%
n-body
Scheme PLT	185.92	185.91	13,536	1558	0% 0% 0% 100%
Perl	1,639.61	1,639.53	2,572	1140	0% 0% 0% 100%
spectral-norm
Scheme PLT	189.88	189.87	12,644	419	0% 0% 0% 100%
Perl	1,094.72	1,094.65	11,060	846	0% 0% 0% 100%
fasta
Scheme PLT	55.93	55.93	8,844	1053	0% 1% 0% 100%
Perl	311.00	310.98	2,548	934	1% 1% 1% 100%
fannkuch
Scheme PLT	538.66	538.63	12,436	549	0% 0% 0% 100%
Perl	2,660.57	2,660.43	2,060	391	0% 0% 0% 100%
pidigits
Scheme PLT	4.21	4.21	16,976	1131	0% 0% 0% 100%
Perl	7.47	7.48	3,884	385	0% 0% 0% 100%
regex-dna
Scheme PLT	32.93	32.93	631,892	835	0% 0% 0% 100%
Perl	38.78	38.78	165,064	527	0% 0% 0% 100%
k-nucleotide
Scheme PLT	232.64	232.80	1,298,828	623	0% 0% 0% 100%
Perl	225.09	228.97	780,228	359	0% 0% 0% 100%
reverse-complement
Scheme PLT	19.25	19.25	463,972	554	0% 0% 0% 100%
Perl	5.30	5.30	433,056	298	0% 0% 0% 100%
chameneos-redux
Scheme PLT	213.50	213.49	35,348	792	0% 0% 0% 100%
	No Perl

 Measurements for all the accepted programs

Ada 2005 GNAT ATS C GNU gcc C# Mono C++ GNU g++ Clean Erlang HiPE F# Mono Fortran Intel Go 6g 8g Haskell GHC Java 6 -server Java 6 -Xint Java 6 steady state JavaScript TraceMonkey JavaScript V8 Lisp SBCL Lua OCaml Pascal Free Pascal Perl PHP Python CPython Ruby JRuby Ruby MRI Scala Scheme PLT Smalltalk VisualWorks

 Scheme PLT : statically-scoped properly tail-recursive dialect of lisp 

online book "The Scheme Programming Language, Fourth Edition" by R. Kent Dybvig, 2009.

Welcome to MzScheme v4.2.2 [3m], Copyright (c) 2004-2009 PLT Scheme Inc.

Home Page: PLT Scheme

Download: Download MzScheme