binary-trees-redux benchmark N=20

Each chart bar shows how many times slower, one ↓ binary-trees-redux program was, compared to the fastest program.

These are not the only programs that could be written. These are not the only compilers and interpreters. These are not the only programming languages.

Column × shows how many times more each program used compared to the benchmark program that used least.

  ×   Program Source Code CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
1.0Lisp SBCL #2 19.3719.40119,264649  0% 1% 1% 100%
1.3Haskell GHC 25.3025.3374,060521  100% 1% 1% 1%
2.9Clojure 56.8925.52230,468661  50% 63% 64% 47%
5.5Clojure #6 106.2743.55231,584709  63% 63% 59% 61%
13Java  #2 252.4274.26142,128607  86% 88% 84% 85%
13Scala #4 255.8575.55144,048498  82% 82% 87% 90%
41Ruby JRuby 13 min5 min845,216412  75% 71% 52% 53%
missing benchmark programs
Ada 2005 GNAT No program
C gcc No program
C# Mono No program
C++ g++ No program
Dart No program
Erlang HiPE No program
F# Mono No program
Fortran Intel No program
Go No program
OCaml No program
Pascal Free Pascal No program
Perl No program
PHP No program
Python 3 No program
Racket No program
Ruby No program
Rust No program

 binary-trees-redux benchmark : Allocate and deallocate many many binary trees

You can write your own program for this task and contribute to the benchmarks game by following these general instructions.

More specifically:

The binary-trees-redux benchmark is another simplistic adaptation of Hans Boehm's GCBench, which in turn was adapted from a benchmark by John Ellis and Pete Kovac.

Heap size has been limited for each program, to 8KB more than that program needs to complete the task.

Revised BSD license

  Home   Conclusions   License   Play