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 #2 16.037.356961663  61% 52% 49% 56%
1.1Go #5 7.987.98760957  0% 1% 100% 0%
1.7C++ g++ #5 11.233.071,2121994  100% 100% 84% 83%
1.8C++ g++ #2 10.192.871,2802016  100% 58% 100% 98%
2.2C gcc #5 2.780.711,5002863  100% 96% 96% 100%
4.6OCaml #3 20 min13 min3,2041146  35% 35% 35% 35%
5.7Ada 2005 GNAT #5 64.2018.563,9402906  88% 90% 88% 90%
5.9OCaml 7 min282.324,1161279  40% 37% 36% 40%
6.3Python 3 #2 6 min251.834,392866  37% 37% 32% 32%
7.8Ruby 223.34151.565,448920  26% 37% 37% 25%
9.8Perl #4 11 min8 min6,836785  34% 35% 34% 34%
12Haskell GHC #4 11.845.918,588989  100% 100% 2% 1%
15Haskell GHC 9.275.1710,604989  79% 100% 1% 1%
20Erlang HiPE 128.8855.0414,008734  61% 62% 57% 59%
44Java  #4 18.165.3030,7321607  97% 53% 99% 97%
53Lisp SBCL #3 3.000.7936,9882907  92% 97% 99% 92%
55Java  4.443.8238,2961770  35% 25% 29% 26%
59Rust 258.38122.4440,9721692  40% 59% 59% 42%
62C# Mono 22.2010.7943,3201400  55% 49% 50% 51%
72Java  #3 26.517.9250,1761267  68% 93% 79% 96%
86Java  #2 24.229.8959,8921429  70% 68% 59% 48%
113Racket 268.41268.3878,364791  1% 0% 100% 1%
146Scala #2 19.438.88101,3681171  54% 53% 56% 57%
151Racket #2 160.46160.44105,184842  1% 1% 1% 100%
576Clojure 121.61108.22400,6041740  36% 50% 47% 44%
907Ruby JRuby 5 min131.18631,396928  60% 62% 60% 63%
Ada 2005 GNAT #2 Make Error6001
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