Changes between Version 58 and Version 59 of DataParallel/BenchmarkStatus


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

--

Legend:

Unmodified
Added
Removed
Modified
  • DataParallel/BenchmarkStatus

    v58 v59  
    2727[[br]] 
    2828  [http://code.haskell.org/repa/repa-head/repa-examples/MMult/ MMult]:: 
    29    Matrix-Matrix multiplication. 
     29   Matrix-Matrix multiplication. Size=1024x1024. 
    3030 
    3131  || '''name''' || '''runtime''' || '''speedup''' || '''notes''' 
     
    3939[[br]] 
    4040  [http://code.haskell.org/repa/repa-head/repa-examples/Laplace/ Laplace] '''(SLOWLORIS)''':: 
    41    Solves the Laplace equation in the 2D plane. 
     41   Solves the Laplace equation in the 2D plane. Size=400x400. 
    4242 
    4343  || '''name''' || '''runtime''' || '''speedup''' || '''notes''' 
     
    5252[[br]] 
    5353  [http://code.haskell.org/repa/repa-head/repa-examples/Blur/ Blur]:: 
    54   Applies a Gaussian blur filter to a 2D image. 
     54  Applies a Gaussian blur filter to a 2D image. Size=512x512. 
    5555 
    5656  '''ToDo:''' Runs ok, but need to add other versions for comparison. 
     
    5959[[br]] 
    6060  [http://code.haskell.org/repa/repa-head/repa-examples/EdgeDetect/ EdgeDetect]:: 
    61   Performs Canny edge detection to a 2D image. 
     61  Performs Canny edge detection to a 2D image. Size=512x512. 
    6262 
    6363  '''ToDo:''' Runs ok, but need to add other versions for comparison. 
     
    133133[[br]] 
    134134 [http://darcs.haskell.org/libraries/dph/dph-examples/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 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. 
     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 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. 
    136136 
    137137  || '''name''' || '''runtime''' || '''speedup''' || '''notes''' || 
     
    144144[[br]] 
    145145 [http://darcs.haskell.org/libraries/dph/dph-examples/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 divide-and-conquer 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 divide-and-conquer algorithms with nested data parallelism. N=1M. 
    147147 
    148148