Changes between Version 44 and Version 45 of DataParallel/BenchmarkStatus


Ignore:
Timestamp:
May 19, 2009 7:35:49 AM (6 years ago)
Author:
chak
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • DataParallel/BenchmarkStatus

    v44 v45  
    1313 [http://darcs.haskell.org/packages/dph/examples/smvm/ SMVM]:: 
    1414  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". 
     15 [http://darcs.haskell.org/packages/dph/examples/quickhull/ Quickhull]:: 
     16  Given a set of points (in a plane), compute the sequence of points that encloses all points in the set. This benchmark is interesting as it is the simplest code that exploits the ability to implement divide-and-conquer algorithms with nested data parallelism.  We have only a "vectorised" version of this benchmark and a sequential Haskell reference implementation, "ref Haskell", using vanilla lists. 
    1517 [http://darcs.haskell.org/packages/dph/examples/primes/ Primes]:: 
    1618  The Sieve of Eratosthenes using parallel writes into a sieve structure represented as an array of `Bool`s.  We currently don't have a proper parallel implementation of this benchmark, as we are missing a parallel version of default backpermute.  The problem is that we need to make the representation of parallel arrays of `Bool` dependent on whether the hardware supports atomic writes of bytes.  '''Investigate whether any of the architectures relevant for DPH actually do have trouble with atomic writes of bytes (aka `Word8`).''' 
    17  [http://darcs.haskell.org/packages/dph/examples/quickhull/ Quickhull]:: 
    18   Given a set of points (in a plane), compute the sequence of points that encloses all points in the set. There is only a vectorised version.  '''Currently doesn't work due to bugs in dph-par.  Also needs to get a wrapper using the new benchmark framework to generated test input and time execution.''' 
    1919 [http://darcs.haskell.org/packages/dph/examples/qsort/ Quicksort]:: 
    2020  FIXME