How big is the measured performance difference?
Each chart bar shows how many times more Time or how many times more Memory one unidentified ↓ chameneos-redux program used, compared to the program that used least Time or the program that used least Memory.
chameneos-redux benchmark N=6,000,000
This table shows 5 measurements - CPU Time, Elapsed Time, Memory, Code and ~ CPU Load.
Compare how much Memory the chameneos-redux programs used - sort Memory KB. Compare how much Code the programs used - sort Code B
Column × shows how many times more each program used compared to the program that used least.
| sort | sort | sort | sort | |||
|---|---|---|---|---|---|---|
| × | Program Source Code | CPU secs | Elapsed secs | Memory KB | Code B | ~ CPU Load |
| 1.0 | C++ GNU g++ #2 | 3.39 | 3.39 | 1,396 | 1606 | 0% 0% 0% 100% |
| 1.2 | Java 6 -server #3 | 3.88 | 3.91 | 41,280 | 1756 | 0% 0% 0% 99% |
| 1.4 | Haskell GHC | 4.72 | 4.73 | 1,884 | 789 | 0% 0% 0% 100% |
| 1.5 | Haskell GHC #2 | 5.05 | 5.06 | 1,880 | 832 | 0% 0% 0% 100% |
| 2.2 | Erlang HiPE | 7.30 | 7.31 | 7,884 | 734 | 0% 99% 1% 0% |
| 2.4 | Go 6g 8g #4 | 8.22 | 8.22 | 832 | 996 | 0% 0% 0% 100% |
| 2.7 | C++ GNU g++ #4 | 9.21 | 9.22 | 1,304 | 1800 | 0% 0% 0% 100% |
| 2.7 | C GNU gcc #5 | 9.24 | 9.24 | 652 | 2879 | 0% 0% 0% 100% |
| 2.7 | C++ GNU g++ | 9.27 | 9.27 | 1,416 | 1798 | 0% 0% 0% 100% |
| 2.7 | C++ GNU g++ #5 | 9.27 | 9.27 | 1,304 | 1994 | 0% 0% 0% 100% |
| 2.8 | C++ GNU g++ #3 | 9.35 | 9.34 | 1,316 | 1845 | 0% 0% 0% 100% |
| 2.9 | C GNU gcc #2 | 9.87 | 9.87 | 656 | 1663 | 0% 0% 0% 100% |
| 3.0 | Go 6g 8g #3 | 10.11 | 10.11 | 832 | 983 | 0% 0% 0% 100% |
| 3.4 | Java 6 steady state #2 | 11.49 | 11.49 | 36,028 | 1513 | 0% 0% 0% 100% |
| 3.4 | Java 6 -server #2 | 11.62 | 11.62 | 35,172 | 1429 | 0% 0% 0% 100% |
| 3.5 | Scala #2 | 12.01 | 12.02 | 37,600 | 1171 | 0% 0% 0% 100% |
| 4.5 | C# Mono | 15.17 | 15.17 | 7,288 | 1409 | 0% 0% 0% 100% |
| 5.8 | Go 6g 8g | 19.74 | 19.74 | 848 | 1142 | 0% 0% 0% 100% |
| 7.0 | Java 6 -server | 23.62 | 23.64 | 44,784 | 1462 | 0% 0% 0% 100% |
| 9.0 | Java 6 -Xint #2 | 30.54 | 30.59 | 33,156 | 1429 | 0% 0% 0% 100% |
| 13 | C GNU gcc | 42.57 | 42.57 | 740 | 1769 | 0% 0% 0% 100% |
| 15 | Java 6 -Xint | 49.44 | 49.48 | 39,112 | 1462 | 1% 1% 0% 100% |
| 16 | Ruby JRuby | 52.86 | 52.89 | 95,612 | 928 | 0% 1% 1% 100% |
| 17 | Smalltalk VisualWorks #2 | 56.27 | 56.27 | 22,856 | 2515 | 0% 0% 0% 100% |
| 17 | OCaml | 57.51 | 57.51 | 2,032 | 1279 | 0% 0% 0% 100% |
| 21 | OCaml #2 | 69.74 | 69.73 | 2,184 | 1286 | 0% 0% 0% 100% |
| 21 | Scala | 72.26 | 72.29 | 85,128 | 1234 | 0% 0% 0% 100% |
| 40 | Python CPython #2 | 134.30 | 134.39 | 3,812 | 869 | 0% 0% 0% 100% |
| 47 | Ruby MRI | 159.12 | 159.12 | 2,656 | 928 | 1% 0% 0% 100% |
| 63 | Scheme PLT | 213.50 | 213.49 | 35,348 | 792 | 0% 0% 0% 100% |
| 84 | Go 6g 8g #2 | 285.16 | 285.15 | 924 | 1170 | 0% 1% 0% 100% |
| Ada 2005 GNAT | Bad Output | 1615 | ||||
| Java 6 -server #4 | Timed Out | 1h 00 min | 1377 | |||
| Java 6 -Xint #4 | Timed Out | 1h 00 min | 1377 | |||
| Java 6 -Xint #3 | Bad Output | 1756 | ||||
| Java 6 steady state #4 | Timed Out | 54.61 | 1464 | |||
| missing programs | ||||||
| ATS | No program | |||||
| Clean | No program | |||||
| F# Mono | No program | |||||
| Fortran Intel | No program | |||||
| JavaScript TraceMonkey | No program | |||||
| JavaScript V8 | No program | |||||
| Lisp SBCL | No program | |||||
| Lua | No program | |||||
| Pascal Free Pascal | No program | |||||
| Perl | 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.
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 kernel threads, lightweight threads; but coroutines, cooperative threads and other programs with custom schedulers will be listed as interesting alternative implementations. Briefly say what concurrency technique is used in the program header comment.