How big is the measured performance difference?
Each chart bar shows how many times more Time or how many times more Memory one unidentified ↓ reverse-complement program used, compared to the program that used least Time or the program that used least Memory.
reverse-complement benchmark ~240MB N=25,000,000
This table shows 5 measurements - CPU Time, Elapsed Time, Memory, Code and ~ CPU Load.
Compare how much Memory the reverse-complement 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++ #4 | 1.34 | 0.92 | 245,440 | 2275 | 68% 50% 14% 15% |
| 1.3 | C++ GNU g++ #2 | 1.87 | 1.16 | 245,096 | 1098 | 88% 32% 22% 22% |
| 1.3 | ATS | 1.19 | 1.19 | 122,628 | 2077 | 0% 0% 2% 100% |
| 1.5 | Ada 2005 GNAT #2 | 1.72 | 1.34 | 197,584 | 3132 | 38% 3% 0% 90% |
| 1.5 | C GNU gcc #4 | 1.37 | 1.37 | 125,192 | 722 | 100% 1% 1% 1% |
| 1.9 | C++ GNU g++ #3 | 1.76 | 1.76 | 125,272 | 810 | 100% 0% 1% 0% |
| 2.5 | Scala #4 | 2.40 | 2.34 | 400,424 | 505 | 2% 3% 2% 97% |
| 2.6 | Pascal Free Pascal #2 | 2.42 | 2.42 | 122,792 | 751 | 100% 1% 0% 0% |
| 3.2 | Java 6 -server #4 | 2.98 | 2.94 | 473,712 | 592 | 1% 94% 4% 2% |
| 3.3 | C# Mono | 3.04 | 3.05 | 161,720 | 1099 | 1% 0% 100% 0% |
| 4.4 | Haskell GHC #2 | 4.00 | 4.00 | 618,012 | 913 | 0% 0% 0% 100% |
| 4.7 | C++ GNU g++ | 4.29 | 4.29 | 245,384 | 571 | 100% 0% 0% 0% |
| 4.8 | Lisp SBCL | 4.42 | 4.41 | 227,408 | 896 | 100% 0% 0% 0% |
| 5.2 | OCaml #2 | 4.78 | 4.78 | 168,924 | 394 | 100% 0% 0% 0% |
| 5.9 | Go 6g 8g | 5.44 | 5.44 | 160,388 | 550 | 0% 99% 1% 0% |
| 6.3 | Perl #4 | 5.78 | 5.79 | 124,036 | 237 | 0% 0% 0% 100% |
| 7.7 | PHP #2 | 7.09 | 7.09 | 444,444 | 343 | 0% 0% 0% 100% |
| 8.3 | Python CPython #3 | 7.64 | 7.64 | 538,340 | 288 | 100% 0% 0% 0% |
| 8.3 | Ada 2005 GNAT | 7.64 | 7.65 | 130,268 | 885 | 0% 0% 100% 0% |
| 8.3 | C# Mono #3 | 8.74 | 7.66 | 211,284 | 863 | 5% 5% 99% 5% |
| 11 | PHP | 9.76 | 9.77 | 369,992 | 297 | 0% 0% 100% 0% |
| 11 | Ruby MRI #2 | 10.09 | 10.09 | 197,348 | 255 | 0% 98% 0% 0% |
| 11 | Ruby 1.9 #2 | 10.37 | 10.36 | 174,080 | 255 | 100% 0% 0% 0% |
| 12 | Fortran Intel #2 | 11.26 | 11.26 | 166,568 | 772 | 0% 0% 0% 100% |
| 14 | Lua LuaJIT | 13.25 | 13.25 | 398,640 | 538 | 100% 0% 0% 0% |
| 20 | Ruby JRuby #2 | 20.18 | 18.27 | 467,396 | 255 | 7% 6% 91% 7% |
| 22 | Scheme PLT #2 | 20.49 | 20.49 | 383,816 | 554 | 100% 0% 0% 0% |
| 24 | Lua | 21.90 | 21.90 | 517,760 | 538 | 100% 0% 0% 0% |
| 25 | Lua LuaJIT #3 | 22.64 | 22.63 | 154,064 | 593 | 100% 0% 0% 0% |
| 25 | Java 6 -Xint #4 | 22.91 | 22.92 | 471,268 | 592 | 0% 0% 100% 0% |
| 28 | Lua #3 | 25.96 | 25.97 | 153,044 | 593 | 43% 57% 0% 0% |
| 29 | Smalltalk VisualWorks | 26.69 | 26.69 | 289,904 | 754 | 100% 0% 0% 0% |
| 32 | Scala #5 | 30.46 | 29.69 | 554,084 | 358 | 2% 1% 2% 98% |
| 35 | Python 3 #3 | 31.83 | 31.83 | 1,021,976 | 294 | 0% 100% 0% 0% |
| 41 | Perl #2 | 37.73 | 37.73 | 411,880 | 298 | 0% 0% 0% 100% |
| 43 | JavaScript V8 #2 | 39.49 | 39.49 | 317,988 | 456 | 0% 0% 0% 100% |
| 46 | Perl | 42.01 | 42.01 | 447,592 | 299 | 0% 0% 100% 0% |
| 50 | Erlang HiPE #4 | 55.48 | 45.64 | 626,136 | 1167 | 9% 7% 79% 26% |
| 67 | JavaScript TraceMonkey #2 | 61.49 | 61.49 | 894,528 | 456 | 0% 0% 100% 0% |
| 75 | Erlang HiPE #3 | 70.87 | 68.74 | 693,564 | 624 | 3% 0% 99% 0% |
| 97 | Mozart/Oz | 84.96 | 89.06 | 2,993,976 | 651 | 44% 22% 24% 18% |
| Clean | Timed Out | 1h 00 min | 834 | |||
| Lisaac #2 | Make Error | 762 | ||||
| OCaml #3 | Failed | 582 | ||||
| OCaml | Failed | 540 | ||||
| interesting alternative programs | ||||||
| Perl #3 | Bad Output | 263 | ||||
| Lisaac | Failed | 473 | ||||
| missing programs | ||||||
| F# Mono | No program | |||||
| Java 6 steady state | No program | |||||
reverse-complement benchmark : Read DNA sequences - write their reverse-complement
diff program output for this 10KB input file (generated with the fasta program N = 1000) with this output file to check your program is correct before contributing.
We use the FASTA file generated by the fasta benchmark as input for this benchmark. Note: the file may include both lowercase and uppercase codes.
Each program should
- read line-by-line a redirected FASTA format file from stdin
- for each sequence:
- write the id, description, and the reverse-complement sequence in FASTA format to stdout
We use these code complements:
code meaning complement A A T C C G G G C T/U T A M A or C K R A or G Y W A or T W S C or G S Y C or T R K G or T M V A or C or G B H A or C or T D D A or G or T H B C or G or T V N G or A or T or C N
"by knowing the sequence of bases of one strand of DNA we immediately know the sequence of the DNA strand which will bind to it, this strand is called the reverse complement"
DNA: Structure and Function