Changes between Version 25 and Version 26 of DataParallel/BenchmarkStatus


Ignore:
Timestamp:
Mar 6, 2009 3:54:38 AM (6 years ago)
Author:
chak
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • DataParallel/BenchmarkStatus

    v25 v26  
    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/primes/ Primes]::
     16  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`).'''
    1517
    1618=== Execution on !LimitingFactor (2x Quad-Core Xeon) ===