# Changes between Version 97 and Version 98 of DataParallel/BenchmarkStatus

Show
Ignore:
Timestamp:
12/12/10 17:30:45 (3 years ago)
Comment:

--

Unmodified
Removed
Modified
• ## DataParallel/BenchmarkStatus

v97 v98
139139
140140 [[br]]
141 [http://darcs.haskell.org/packages/dph/examples/smvm/ SMVM] '''(BROKEN - Fusion)'''::
142142 Multiplies a dense vector with a sparse matrix represented in the ''compressed sparse row format (CSR).'' [[br]]
143143

155155
156156[[br]]
157 [http://darcs.haskell.org/libraries/dph/dph-examples/spectral/QuickSort/ QuickSort] '''(BROKEN - SpecConstr) (SLOWDOWN)'''::
158158  Sort a vector of doubles by recursively splitting it and sorting the two halves. This is a naive benchmark used for regression testing only. We divide right down to two-point vectors and construct the result using copying append. A production algorithm would switch to an in-place sort once the size of the vector reaches a few thousand elements. N=100k.
159159

191191These programs also use user defined algebraic data types. Vectorization of these programs is still a work in progress.
192192
193 [http://darcs.haskell.org/libraries/dph/dph-examples/imaginary/Words/ Words] '''(BROKEN - SpecConstr)'''::
194194  Counts the number of words in a string. This is a naive divide-and-conquer benchmark that divides right down to a single character. A production program would switch to a simple sequential algorithm once the string chunks were small enough. It's a good stress test for the vectoriser though.
195195

198198
199199[[br]]