chameneos-redux benchmark N=6,000,000

Each chart bar shows how many times more Memory, one ↓ chameneos-redux program used, compared to the program that used least Memory.

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.

    sortsort sort
  ×   Program Source Code CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
1.0C gcc #5 2.540.645682863  98% 100% 100% 100%
1.0C gcc #2 41.7612.955841663  86% 72% 85% 90%
1.4Go #5 4.724.73772957  1% 1% 1% 100%
1.6C++ g++ #5 11.302.969081994  100% 100% 92% 92%
2.9Ada 2005 GNAT #5 58.3516.091,6202906  93% 93% 93% 93%
3.6OCaml 9 min5 min2,0281279  33% 44% 43% 32%
4.3Haskell GHC #4 11.445.732,464989  99% 100% 1% 1%
4.4Haskell GHC 9.665.312,472989  81% 100% 2% 1%
5.1OCaml #3 20 min13 min2,8801146  10% 65% 64% 9%
6.4Ada 2005 GNAT #2 8.242.113,6566001  96% 96% 99% 100%
7.8Python 3 #2 6 min259.154,412866  44% 45% 27% 26%
9.5Ruby 224.14153.205,400920  40% 23% 23% 40%
12Perl #4 13 min9 min6,684785  46% 19% 18% 46%
20Erlang HiPE 135.1855.2611,292734  50% 73% 72% 53%
40C# Mono 70.1721.6622,5721400  86% 88% 78% 81%
46Java  #4 18.225.2726,3241607  86% 98% 66% 97%
55Java  5.004.4231,4561770  40% 43% 12% 17%
65Lisp SBCL #3 3.210.8736,9882907  86% 99% 99% 87%
74Java  #2 39.2213.0242,0041429  84% 74% 79% 69%
77Rust 230.70115.5943,8801622  53% 50% 49% 41%
99Java  #3 26.347.8456,0081267  97% 99% 63% 78%
103Scala #2 37.4313.5758,4641171  71% 65% 75% 69%
110Racket 5 min5 min62,568791  0% 0% 0% 100%
688Clojure 166.05143.09390,9921331  30% 29% 29% 30%
935Ruby JRuby 99.5843.99531,344928  57% 56% 56% 57%
C++ g++ Make Error2449
Scala Failed1271
missing benchmark programs
Dart No program
F# Mono No program
Fortran Intel No program
Pascal Free Pascal No program
PHP No program

 chameneos-redux benchmark : Symmetrical thread rendezvous requests

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

More specifically:

ndiff program output N = 600 with this output file to check your program output has the correct format before contributing.

We are trying to show the performance of various programming language implementations - so we ask that contributed programs not only give the correct result, but also use the same algorithm to calculate that result.

The text-part and spelled-out numbers in the program output should match the expected output exactly. Thread scheduling may cause small differences in the other numbers, so program output is checked with ndiff -fields 2-10

Each program should

The chameneos benchmark is an adaptation of "Chameneos, a Concurrency Game for Java, Ada and Others" 100KB pdf (which includes example implementations in Java, Ada and C).

Programs may use pre-emptive kernel threads or pre-emptive lightweight threads; but programs that use non pre-emptive threads (coroutines, cooperative threads) and any programs that use custom schedulers, will be listed as interesting alternative implementations. Briefly say what concurrency technique is used in the program header comment.

Revised BSD license

  Home   Conclusions   License   Play