Changes between Version 58 and Version 59 of DataParallel/BenchmarkStatus
 Timestamp:
 Dec 2, 2010 5:22:25 AM (6 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

DataParallel/BenchmarkStatus
v58 v59 27 27 [[br]] 28 28 [http://code.haskell.org/repa/repahead/repaexamples/MMult/ MMult]:: 29 MatrixMatrix multiplication. 29 MatrixMatrix multiplication. Size=1024x1024. 30 30 31 31  '''name'''  '''runtime'''  '''speedup'''  '''notes''' … … 39 39 [[br]] 40 40 [http://code.haskell.org/repa/repahead/repaexamples/Laplace/ Laplace] '''(SLOWLORIS)''':: 41 Solves the Laplace equation in the 2D plane. 41 Solves the Laplace equation in the 2D plane. Size=400x400. 42 42 43 43  '''name'''  '''runtime'''  '''speedup'''  '''notes''' … … 52 52 [[br]] 53 53 [http://code.haskell.org/repa/repahead/repaexamples/Blur/ Blur]:: 54 Applies a Gaussian blur filter to a 2D image. 54 Applies a Gaussian blur filter to a 2D image. Size=512x512. 55 55 56 56 '''ToDo:''' Runs ok, but need to add other versions for comparison. … … 59 59 [[br]] 60 60 [http://code.haskell.org/repa/repahead/repaexamples/EdgeDetect/ EdgeDetect]:: 61 Performs Canny edge detection to a 2D image. 61 Performs Canny edge detection to a 2D image. Size=512x512. 62 62 63 63 '''ToDo:''' Runs ok, but need to add other versions for comparison. … … 133 133 [[br]] 134 134 [http://darcs.haskell.org/libraries/dph/dphexamples/spectral/QuickSort/ QuickSort] '''(BROKEN)''':: 135 Sort a vector of doubles by recursively splitting the vector and sorting the two halves. This is a naive benchmark used for regression testing only. We divide right down to twopoint vectors and construct the result using copying append. A production algorithm would switch to an inplace sort once the size of the vector reaches a few thousand elements. 135 Sort a vector of doubles by recursively splitting the vector and sorting the two halves. This is a naive benchmark used for regression testing only. We divide right down to twopoint vectors and construct the result using copying append. A production algorithm would switch to an inplace sort once the size of the vector reaches a few thousand elements. N=100k. 136 136 137 137  '''name'''  '''runtime'''  '''speedup'''  '''notes'''  … … 144 144 [[br]] 145 145 [http://darcs.haskell.org/libraries/dph/dphexamples/spectral/QuickHull/ Quickhull] '''(SLOWLORIS)''':: 146 Given a set of points in the 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 divideandconquer algorithms with nested data parallelism. 146 Given a set of points in the 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 divideandconquer algorithms with nested data parallelism. N=1M. 147 147 148 148