chameneos-redux benchmark N=6,000,000

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

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.0Erlang HiPE 135.1855.2611,292734  50% 73% 72% 53%
1.1Perl #4 13 min9 min6,684785  46% 19% 18% 46%
1.1Racket 5 min5 min62,568791  0% 0% 0% 100%
1.2Python 3 #2 6 min259.154,412866  44% 45% 27% 26%
1.3Ruby 214.12140.155,596920  35% 28% 28% 35%
1.3Ruby JRuby 129.5256.59493,988928  57% 58% 60% 53%
1.3Go #5 4.724.73772957  1% 1% 1% 100%
1.3Haskell GHC #4 11.445.732,464989  99% 100% 1% 1%
1.3Haskell GHC 9.665.312,472989  81% 100% 2% 1%
1.6OCaml #3 20 min13 min2,8801146  10% 65% 64% 9%
1.6Scala #2 41.0214.3336,9361171  72% 80% 71% 67%
1.7Java  #3 26.787.9634,1001267  97% 96% 99% 44%
1.7OCaml 9 min5 min2,0281279  33% 44% 43% 32%
1.8Clojure 177.08151.14383,9241331  30% 27% 26% 28%
1.9C# Mono 73.4422.3722,8241400  88% 84% 84% 82%
1.9Java  #2 38.7813.3132,7441429  77% 81% 72% 65%
2.2Java  #4 19.825.6417,7081607  97% 100% 98% 59%
2.3C gcc #2 41.7612.955841663  86% 72% 85% 90%
2.4Java  5.764.9625,3641770  32% 24% 28% 29%
2.7C++ g++ #5 11.302.969081994  100% 100% 92% 92%
3.9C gcc #5 2.540.645682863  98% 100% 100% 100%
4.0Ada 2005 GNAT #5 58.3516.091,6202906  93% 93% 93% 93%
4.0Lisp SBCL #3 3.210.8736,9882907  86% 99% 99% 87%
8.2Ada 2005 GNAT #2 8.242.113,6566001  96% 96% 99% 100%
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
Rust No program

 chameneos-redux benchmark : Symmetrical thread rendezvous requests

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