How big is the measured performance difference?
Each chart bar shows how many times more Time or how many times more Memory one unidentified ↓ fannkuch program used, compared to the program that used least Time or the program that used least Memory.
fannkuch benchmark N=12
This table shows 5 measurements - CPU Time, Elapsed Time, Memory, Code and ~ CPU Load.
Compare how much Memory the fannkuch 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 | Ada 2005 GNAT #2 | 38.11 | 38.12 | 2,064 | 1518 | 0% 0% 0% 100% |
| 1.3 | Fortran Intel | 49.20 | 49.20 | 464 | 521 | 0% 0% 0% 100% |
| 1.3 | C++ GNU g++ #3 | 50.34 | 50.34 | 1,260 | 1186 | 0% 0% 0% 100% |
| 1.3 | C GNU gcc #2 | 51.38 | 51.37 | 692 | 937 | 0% 0% 0% 100% |
| 1.4 | Lisp SBCL #2 | 53.63 | 53.63 | 6,752 | 624 | 0% 0% 0% 100% |
| 1.6 | ATS | 59.88 | 59.88 | 596 | 1191 | 0% 0% 0% 100% |
| 1.7 | OCaml | 63.48 | 63.48 | 932 | 485 | 0% 0% 0% 100% |
| 1.7 | Clean | 66.36 | 66.35 | 620 | 925 | 0% 0% 0% 100% |
| 1.8 | C GNU gcc | 67.87 | 67.86 | 580 | 628 | 0% 0% 0% 100% |
| 1.8 | C++ GNU g++ #2 | 68.00 | 68.00 | 1,224 | 554 | 0% 0% 0% 100% |
| 1.9 | Java 6 -server | 72.68 | 72.68 | 17,460 | 1150 | 0% 0% 0% 100% |
| 2.0 | Java 6 steady state | 76.81 | 76.80 | 18,612 | 1232 | 0% 0% 0% 100% |
| 2.1 | Haskell GHC #5 | 80.41 | 80.41 | 4,412 | 1204 | 0% 0% 0% 100% |
| 2.4 | Java 6 -server #4 | 90.72 | 90.75 | 15,568 | 555 | 0% 0% 0% 100% |
| 2.4 | Scala #2 | 90.79 | 90.80 | 15,852 | 473 | 0% 0% 0% 100% |
| 2.4 | Ada 2005 GNAT | 91.67 | 91.67 | 1,504 | 746 | 0% 0% 0% 100% |
| 2.8 | Scala #3 | 107.96 | 107.96 | 40,932 | 1001 | 0% 0% 0% 100% |
| 3.0 | C# Mono #2 | 113.81 | 113.81 | 6,084 | 1085 | 0% 0% 0% 100% |
| 3.1 | Go 6g 8g | 117.55 | 117.54 | 776 | 523 | 0% 0% 0% 100% |
| 3.2 | C# Mono | 123.52 | 123.52 | 5,752 | 549 | 0% 0% 0% 100% |
| 3.4 | Pascal Free Pascal | 130.22 | 130.21 | 48 | 712 | 0% 0% 0% 100% |
| 3.8 | F# Mono #5 | 143.70 | 143.69 | 8,100 | 470 | 0% 0% 0% 100% |
| 5.3 | OCaml #2 | 203.70 | 203.69 | 6,212 | 975 | 0% 0% 0% 100% |
| 5.7 | F# Mono #4 | 216.89 | 216.88 | 8,336 | 497 | 0% 0% 0% 100% |
| 5.9 | F# Mono #3 | 225.30 | 225.29 | 8,144 | 522 | 0% 0% 0% 100% |
| 14 | Scheme PLT #2 | 8 min | 8 min | 12,436 | 549 | 0% 0% 0% 100% |
| 17 | Java 6 -Xint | 10 min | 10 min | 12,240 | 1150 | 0% 0% 0% 100% |
| 17 | Erlang HiPE #3 | 10 min | 10 min | 8,244 | 864 | 0% 0% 100% 0% |
| 18 | Smalltalk VisualWorks | 11 min | 11 min | 22,796 | 772 | 0% 0% 0% 100% |
| 18 | JavaScript V8 #2 | 11 min | 11 min | 9,264 | 488 | 0% 0% 0% 100% |
| 20 | Java 6 -Xint #4 | 12 min | 12 min | 12,032 | 555 | 0% 0% 0% 100% |
| 35 | Scala | 22 min | 22 min | 361,096 | 453 | 0% 0% 0% 100% |
| 37 | Haskell GHC #3 | 23 min | 23 min | 3,436 | 341 | 0% 0% 0% 100% |
| 48 | Ruby JRuby #3 | 30 min | 30 min | 97,672 | 340 | 0% 0% 0% 100% |
| 49 | Lua | 30 min | 30 min | 1,068 | 492 | 0% 0% 0% 100% |
| 60 | JavaScript TraceMonkey #2 | 38 min | 38 min | 2,696 | 488 | 0% 0% 0% 100% |
| 70 | Perl #2 | 44 min | 44 min | 2,060 | 391 | 0% 0% 0% 100% |
| 84 | Erlang HiPE | 53 min | 53 min | 8,024 | 594 | 0% 49% 50% 0% |
| 88 | Python CPython #2 | 56 min | 56 min | 3,580 | 387 | 0% 0% 0% 100% |
| 97 | Perl #3 | 1h 01 min | 1h 01 min | 8,804 | 471 | 0% 0% 0% 100% |
| 106 | Perl | 1h 07 min | 1h 07 min | 1,976 | 348 | 0% 0% 0% 100% |
| 117 | PHP #3 | 1h 14 min | 1h 14 min | 12,892 | 745 | 0% 0% 0% 100% |
| 178 | Ruby MRI #3 | 1h 52 min | 1h 52 min | 2,588 | 340 | 0% 0% 0% 100% |
| interesting alternative programs | ||||||
| 1.3 | Java 6 -server #3 | 48.53 | 48.55 | 14,304 | 914 | |
| 2.3 | C# Mono #3 | 86.88 | 86.87 | 6,072 | 1089 | |
fannkuch benchmark : Indexed-access to tiny integer-sequence
diff program output N = 7 with this output file to check your program is correct before contributing.
Each program should
- "Take a permutation of {1,...,n}, for example: {4,2,1,5,3}.
- Take the first element, here 4, and reverse the order of the first 4 elements: {5,1,2,4,3}.
- Repeat this until the first element is a 1, so flipping won't change anything more: {3,4,2,1,5}, {2,4,3,1,5}, {4,2,3,1,5}, {1,3,2,4,5}.
- Count the number of flips, here 5.
- Do this for all n! permutations, and record the maximum number of flips needed for any permutation.
- Write the first 30 permutations and the number of flips.
The conjecture is that this maximum count is approximated by n*log(n) when n goes to infinity.
FANNKUCH is an abbreviation for the German word Pfannkuchen, or pancakes, in analogy to flipping pancakes."
The fannkuch benchmark is defined in Performing Lisp Analysis of the FANNKUCH Benchmark, Kenneth R. Anderson and Duane Rettig (26KB postscript)