Changes between Version 49 and Version 50 of DataParallel/BenchmarkStatus

Timestamp:

12/01/10 18:48:47 (3 years ago)

Author:

benl

Comment:

Update numbers

DataParallel/BenchmarkStatus

@@ -8 +8 @@
 
 == Key ==
-<project>.<benchmark-name>.<version>.<parallelism>.<threads>
+<project>.<benchmark>.<version>.<parallelism>.<threads>
 
 Project
@@ -29 +29 @@
 
  [http://darcs.haskell.org/packages/dph/dph-examples/imaginary/SumSquares/ SumSquares]::
-  Computes the sum of the squares from 1 to N using `Int`.  N = 10M.
+  Computes the sum of the squares from 1 to N using `Int`.  N = 100M.
 
   || '''name''' || '''runtime''' || '''speedup''' || '''notes'''
@@ -38 +38 @@
   || dph.sumsq.vectorised.par.N4 || 111ms || 3.63 || ||
 
-  '''Summary''': fine, though we should run a sequential C version as well.
+  '''Summary''': fine[[br]]
+  '''Todo''': Add the sequential C version.
 
 
- [http://darcs.haskell.org/packages/dph/examples/dotp/ DotP]::
-  Computes the dot product of two vectors of `Double`s.  There are two variants of this program: (1) "primitives" is directly coded against the array primitives from package dph and (2) "vectorised" is a high-level DPH program transformed by GHC's vectoriser.  In addition to these two DPH variants of the dot product, we also have two non-DPH reference implementations: (a) "ref Haskell" is a Haskell program using imperative, unboxed arrays and and (b) "ref C" is a C implementation using pthreads.
+ [http://darcs.haskell.org/packages/dph/dph-examples/imaginary/DotProduct DotProduct]::
+  Computes the dot product of two vectors of `Double`s. N=10M.
+
+  || '''name''' || '''runtime''' || '''speedup''' || '''notes'''
+  || dph.sumsq.vector.seq.N4 ||  68ms || 1 || ||
+  || dph.sumsq.vectorised.seq.N4 || 58ms || 1.17 || A ||
+  || dph.sumsq.vectorised.par.N1 || 55ms || 1.24 || ||
+  || dph.sumsq.vectorised.par.N2 || 33ms || 2.06 || ||
+  || dph.sumsq.vectorised.par.N4 || 25ms || 2.72 || ||
+ 
+  A: The vectorised version is faster than with Data.Vector. Why was this?
+
+  '''Summary''': fine.[[br]]
+  '''Todo''': Add the sequential C version.
 
  [http://darcs.haskell.org/packages/dph/examples/smvm/ SMVM]::
-  Multiplies a dense vector with a sparse matrix represented in the ''compressed sparse row format (CSR).''  There are three variants of this program: (1) "primitives" is directly coded against the array primitives from package dph and (2) "vectorised" is a high-level DPH program transformed by GHC's vectoriser.  As a reference implementation, we have a sequential C program denoted by "ref C".
+  Multiplies a dense vector with a sparse matrix represented in the ''compressed sparse row format (CSR).''  
+
+  '''Todo''': Add this to the nightly run.
 
 [[br]]