Changes between Version 41 and Version 42 of DataParallel/BenchmarkStatus


Ignore:
Timestamp:
Mar 9, 2009 1:55:56 PM (6 years ago)
Author:
chak
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • DataParallel/BenchmarkStatus

    v41 v42  
    107107=== Summary ===
    108108
    109 The speedup relative to a sequential C program for !SumSq, DotP, and SMVM on both architectures is illustrated by [http://www.cse.unsw.edu.au/~chak/project/dph/benchmarks/speedup-mar09.png this graph.]  In all cases, the data parallel Haskell program outperforms the sequential C program by a large margin on 8 cores.
     109The speedup relative to a sequential C program for !SumSq, DotP, and SMVM on both architectures is illustrated by [http://www.cse.unsw.edu.au/~chak/project/dph/benchmarks/speedup-mar09.png this graph.]  In all cases, the data parallel Haskell program outperforms the sequential C program by a large margin on 8 cores.  The gray graph is a parallel C program computing the dot product using pthreads.  It clearly shows that the two Quad-Core Xeon with 8x1 threads are memory-limited for this benchmark, and the C code is barely any faster on 8 cores than the Haskell code.