Benchmarks Game/Parallel
From HaskellWiki
(Difference between revisions)
(I have parallelized k-nucleotide) |
|||
| Line 4: | Line 4: | ||
== Advice == | == Advice == | ||
| - | * Check the GC stats with +RTS -sstderr -RTS, if that number if over 5%, use - | + | * Check the GC stats with +RTS -sstderr -RTS, if that number if over 5%, use -HxxxM to set a better default heap size. (Note *this is probably not permitted by the "intial allocation area rule" for the binary-trees benchmark). |
| - | * Use N | + | * Use N capabilities for SMP, e.g. +RTS -N4 -RTS, for the quad core. |
* Take the single threaded, fast programs and parallise them | * Take the single threaded, fast programs and parallise them | ||
* Parallel strategies are the lightest way to add SMP capabilities. | * Parallel strategies are the lightest way to add SMP capabilities. | ||
Revision as of 01:57, 3 March 2009
Quad-core enabled parallel Haskell benchmark entries, for the 64 bit quad core shootout.
1 Advice
- Check the GC stats with +RTS -sstderr -RTS, if that number if over 5%, use -HxxxM to set a better default heap size. (Note *this is probably not permitted by the "intial allocation area rule" for the binary-trees benchmark).
- Use N capabilities for SMP, e.g. +RTS -N4 -RTS, for the quad core.
- Take the single threaded, fast programs and parallise them
- Parallel strategies are the lightest way to add SMP capabilities.
- Contact dons or sbahra on #haskell for access to a quad or eight-way benchmark machine, before uploading.
- See if you can use the new parallel GC to good effect: no entries currently do.
2 Parallel Programs
- /BinaryTrees and /BinaryTreesDPH
- /Chameneos
- /Fannkuch
- /Mandelbrot
- /RegexDNA
- /SpectralNorm
- /ThreadRing
- /Knucleotide
3 Not yet parallelised
- /Fasta
- /MeteorContest
- /NBody
- /Pidigits (note GHC 6.10.1 has a GC bug illustrated by this program)
- /ReverseComplement
