Changes between Version 63 and Version 64 of DataParallel/BenchmarkStatus
 Timestamp:
 Dec 2, 2010 7:16:09 AM (7 years ago)
Legend:
 Unmodified
 Added
 Removed
 Modified

DataParallel/BenchmarkStatus
v63 v64 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 vectorand 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.135 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 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''' 