[Haskell-cafe] performance of map reduce
manlio_perillo at libero.it
Fri Sep 19 12:41:52 EDT 2008
there is a map reduce based log parser.
I have written an alternative version:
but, with a file of 315 MB, I have :
1) map reduce implementation, non parallel
2) map reduce implementation, parallel with 2 cores
3) my implementation
What is the reason of the map reduce implementation being faster, even
if not parallelized?
It is possible to implement a map reduce version that can handle gzipped
 These tests does not consider the "first run".
For the first run (no data in OS cache), I have (not verified):
1) map reduce implementation, parallel with 2 cores
2) my implementation
Thanks Manlio Perillo
More information about the Haskell-Cafe