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 123.8650.6517,236734  67% 57% 58% 65%
1.0Erlang 120.8749.7114,208734  51% 73% 70% 50%
1.1Perl #4 11 min8 min9,408785  56% 57% 9% 9%
1.1Racket 5 min5 min109,448791  0% 0% 100% 0%
1.2Python 3 #2 6 min216.595,724866  42% 37% 36% 42%
1.3Ruby 210.06133.247,416920  27% 41% 41% 26%
1.3Ruby JRuby 110.4849.36663,448928  61% 54% 51% 57%
1.3Go #5 4.364.351,032957  100% 1% 0% 1%
1.3Haskell GHC 8.744.822,976989  80% 100% 2% 1%
1.3Haskell GHC #4 11.265.622,980989  99% 100% 1% 2%
1.6OCaml #3 20 min12 min4,3801146  25% 48% 47% 24%
1.6Scala #2 36.8212.8167,0921171  74% 77% 74% 65%
1.7Java  #3 27.088.0693,6601267  84% 87% 74% 92%
1.7OCaml 8 min289.363,2801279  32% 47% 46% 30%
1.8Clojure 156.85134.78415,2481331  32% 30% 24% 25%
1.9Java  #2 36.3712.1690,9361429  84% 71% 65% 82%
2.2Java  #4 16.124.5632,5241607  97% 64% 97% 97%
2.2Rust 201.60100.8145,9761622  46% 57% 50% 39%
2.3C gcc #2 46.3713.416681663  97% 77% 76% 98%
2.4Java  5.314.6738,1521770  31% 22% 26% 32%
2.7C++ g++ #5 2.960.791,3801994  90% 90% 100% 100%
3.9C gcc #5 2.310.606322863  100% 95% 93% 100%
4.0Ada 2005 GNAT #5 49.8413.272,2602906  95% 97% 96% 94%
4.0Lisp SBCL #3 3.570.9242,1602907  100% 96% 96% 97%
8.2Ada 2005 GNAT #2 7.922.011,9326001  98% 98% 100% 100%
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