chameneos-redux benchmark N=6,000,000

Each chart bar shows how many times slower, one ↓ chameneos-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.

     sortsortsort
  ×   Program Source Code CPU secs Elapsed secs Memory KB Code B ≈ CPU Load
1.0C gcc #5 2.240.581,5642863  100% 100% 97% 97%
1.2C++ g++ #5 2.630.751,5881994  79% 78% 99% 100%
1.6Java  3.703.3845,8721770  28% 29% 26% 27%
1.7Lisp SBCL #3 3.861.0140,0962907  93% 94% 99% 99%
3.3Go #5 7.357.351,020957  1% 0% 0% 100%
3.7Haskell GHC 8.344.639,108989  79% 100% 2% 2%
5.0Haskell GHC #4 11.235.597,068989  100% 100% 2% 1%
5.0C++ g++ #2 11.283.191,6482016  94% 99% 100% 62%
5.2C gcc #2 11.645.548881663  61% 58% 50% 42%
7.4Java  #4 16.684.7637,2721607  96% 60% 99% 97%
8.5Java  #2 18.997.9865,0081429  62% 59% 61% 57%
9.1Scala #2 20.408.61165,5201171  59% 55% 60% 64%
12Java  #3 27.468.16161,1961267  89% 91% 95% 64%
19Ada 2005 GNAT #5 42.8312.254,1642906  90% 89% 89% 90%
49Ruby JRuby 110.4849.36663,448928  61% 54% 51% 57%
54Erlang 120.4753.0028,864734  65% 52% 53% 60%
57Erlang HiPE 128.2854.5632,328734  67% 54% 54% 63%
70Clojure 156.85134.78415,2481331  32% 30% 24% 25%
75Racket #2 168.89168.94122,548842  0% 1% 1% 100%
86Ruby 192.03122.967,500920  39% 28% 28% 38%
109Rust 243.55113.8843,1041692  62% 44% 44% 52%
131Racket 293.37293.44123,624791  40% 1% 60% 0%
142Python 3 #2 5 min217.635,720866  34% 33% 33% 33%
180OCaml 6 min244.645,3281279  41% 33% 33% 41%
282Perl #4 10 min7 min12,036785  36% 35% 34% 36%
517OCaml #3 19 min12 min5,9361146  35% 35% 35% 35%
Ada 2005 GNAT #2 Make Error6001
C# Mono Failed1400
C++ g++ Make Error2449
Scala Failed1271
missing benchmark programs
Dart No program
F# Mono No program
Fortran Intel No program
Hack 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