An Experimental Analysis of Parallel Sorting Algorithms (1998) [15 citations — 2 self]
http://www.cs.cmu.edu/afs/cs.cmu.edu/project/phren
http://www.cs.utexas.edu/users/plaxton/html/../ps/
http://www.cs.cmu.edu/afs/cs.cmu.edu/project/phren
CACHED:
|
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Guy E. Blelloch and C. Greg Plaxton and Charles E. Leiserson and Stephen J. Smith and Bruce M. Maggs and Marco Zagha},
title = {An Experimental Analysis of Parallel Sorting Algorithms},
year = {1998}
}
Bookmarks
OpenURL
Abstract:
We have developed a methodology for predicting the performance of parallel algorithms on real parallel machines. The methodology consists of two steps. First, we characterize a machine by enumerating the primitive operations that it is capable of performing along with the cost of each operation. Next, we analyze an algorithm by making a precise count of the number of times the algorithm performs each type of operation. We have used this methodology to evaluate many of the parallel sorting algorithms proposed in the literature. Of these, we selected the three most promising, Batcher's bitonic sort, a parallel radix sort, and a sample sort similar to Reif and Valiant's flashsort, and implemented them on the Connection Machine model CM-2. This paper analyzes the three algorithms in detail and discusses the issues that led us to our particular implementations. On the CM-2 the predicted performance of the algorithms closely matches the observed performance, and hence our methodology can be ...
