Changes between Version 55 and Version 56 of DataParallel/BenchmarkStatus


Ignore:
Timestamp:
Dec 2, 2010 4:27:10 AM (5 years ago)
Author:
benl
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • DataParallel/BenchmarkStatus

    v55 v56  
    1414 * !QuickHull: vectorised.par.N1 version is 6x slower than the immutable Data.Vector version in absolute terms. This may be related to the problem with Evens.
    1515 * !QuickSort: vectorised.seq version doesn't compile due to a blow-up in !SpecConstr.
    16  * NBody: has a core-lint error due to a bug in the rule matcher. If you turn off -dcore-lint it segfaults when run. Before recent GHC changes it compiled (with core-lint error), but vectorised.par Barnes-Hut algorithm was 50x slower than the version using immutable Data.Vector.
     16 * !BarnesHut: has a core-lint error due to a bug in the rule matcher. If you turn off -dcore-lint it segfaults when run. Before recent GHC changes it compiled (with core-lint error), but vectorised.par Barnes-Hut algorithm was 50x slower than the version using immutable Data.Vector.
    1717
    1818= !ToDo =
     
    124124These programs also use user defined algebraic data types. Vectorization of these programs is still a work in progress.
    125125
    126  [http://darcs.haskell.org/packages/dph/dph-examples/barnesHut/ BarnesHut]::
    127   This benchmark implements the Barnes-Hut algorithm to solve the ''n''-body problem in two dimensions.  '''Currently won't compile with vectorisation due to excessive inlining of dictionaries.'''
     126 [http://darcs.haskell.org/libraries/dph/dph-examples/real/NBody/ BarnesHut] '''(BROKEN)'''::
     127  This benchmark implements the Barnes-Hut algorithm to solve the ''n''-body problem in two dimensions. There is a naive O(n^2^) version in the same package.
     128
     129  '''Status''': Core-lint error due to bug in GHC's rule matcher. If we compile without -dcore-lint it segfaults when run.
    128130
    129131[[br]]