18 Dec
2009
18 Dec
'09
8:52 p.m.
On Thursday 10 December 2009 01:00:55 Erik de Castro Lopo wrote:
Erik de Castro Lopo wrote:
So why not look at Data Parallel Haskell:
http://www.haskell.org/haskellwiki/GHC/Data_Parallel_Haskell
Quicksort example:
http://darcs.haskell.org/ghc-6.10/packages/dph/examples/qsort/
I haven't tested this.
It isn't even a real quicksort => it will be orders of magnitude slower than a real quicksort. -- Dr Jon Harrop, Flying Frog Consultancy Ltd. http://www.ffconsultancy.com/?e