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.
| sort | sort | sort | ||||
| × | Program Source Code | CPU secs | Elapsed secs | Memory KB | Code B | ≈ CPU Load |
|---|---|---|---|---|---|---|
| 1.0 | C gcc #5 | 3.10 | 0.79 | 568 | 2863 | 99% 100% 100% 99% |
| 1.2 | C++ g++ #5 | 3.46 | 0.92 | 908 | 1994 | 89% 90% 100% 100% |
| 1.3 | Lisp SBCL #3 | 3.56 | 1.00 | 4,628 | 2907 | 80% 99% 100% 80% |
| 2.6 | Ada 2005 GNAT #2 | 8.19 | 2.08 | 1,636 | 6001 | 99% 99% 99% 99% |
| 6.4 | Go #5 | 5.06 | 5.06 | 1,004 | 957 | 0% 1% 100% 0% |
| 6.6 | Java 7 | 6.57 | 5.19 | 29,584 | 1770 | 37% 20% 19% 44% |
| 8.1 | C++ g++ | 23.47 | 6.39 | 1,288 | 2449 | 97% 96% 87% 87% |
| 11 | Java 7 #3 | 29.11 | 8.55 | 48,252 | 1267 | 94% 81% 70% 96% |
| 16 | Java 7 #2 | 37.64 | 12.59 | 30,756 | 1429 | 70% 88% 81% 59% |
| 16 | C gcc #2 | 44.59 | 12.96 | 596 | 1663 | 90% 89% 92% 78% |
| 17 | Scala #2 | 38.65 | 13.66 | 51,264 | 1171 | 62% 85% 84% 50% |
| 23 | Ada 2005 GNAT #5 | 69.67 | 17.86 | 1,900 | 2906 | 98% 98% 98% 98% |
| 31 | C# Mono | 84.43 | 24.48 | 20,972 | 1400 | 89% 86% 89% 85% |
| 47 | Haskell GHC #4 | 86.65 | 37.17 | 3,304 | 991 | 59% 59% 48% 50% |
| 49 | Ruby JRuby | 85.35 | 38.52 | 457,728 | 928 | 51% 52% 54% 56% |
| 70 | Erlang HiPE | 135.18 | 55.26 | 11,292 | 734 | 50% 73% 72% 53% |
| 187 | Clojure | 177.26 | 146.75 | 394,816 | 1331 | 35% 35% 23% 22% |
| 238 | Ruby 2.0 | 290.60 | 186.72 | 5,100 | 920 | 25% 24% 46% 44% |
| 356 | OCaml | 7 min | 280.12 | 2,044 | 1279 | 21% 59% 57% 19% |
| 371 | Python 3 #2 | 8 min | 291.38 | 4,772 | 866 | 27% 50% 50% 26% |
| 429 | Racket | 5 min | 5 min | 57,752 | 791 | 0% 0% 100% 0% |
| 719 | Perl #4 | 13 min | 9 min | 6,684 | 785 | 46% 19% 18% 46% |
| 869 | OCaml #3 | 18 min | 11 min | 2,868 | 1146 | 53% 22% 27% 54% |
| Scala | Failed | 1271 | ||||
| missing benchmark programs | ||||||
| ATS | No program | |||||
| 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
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
- create differently coloured (blue, red, yellow), differently named, concurrent chameneos creatures
- each creature will repeatedly go to the meeting place and meet, or wait to meet, another chameneos "(at the request the caller does not know whether another chameneos is already present or not, neither if there will be one in some future)"
- both creatures will change colour to complement the colour of the chameneos that they met - don't use arithmetic to complement the colour, use if-else or switch/case or pattern-match
- write all the colour changes for blue red and yellow creatures, using the colour complement function
- for rendezvouses with an odd number of creatures (blue red yellow) and with an even number of creatures (blue red yellow red yellow blue red yellow red blue)
- write the colours the creatures start with
- after N meetings have taken place, for each creature write the number of creatures met and spell out the number of times the creature met a creature with the same name (should be zero)
- spell out the sum of the number of creatures met (should be 2N)
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.