Fast Parallel Sorting Under LogP: Experience with the CM-5

@article{ArpaciDusseau1996FastPS,
  title={Fast Parallel Sorting Under LogP: Experience with the CM-5},
  author={Andrea C. Arpaci-Dusseau and David E. Culler and Klaus E. Schauser and Richard P. Martin},
  journal={IEEE Trans. Parallel Distrib. Syst.},
  year={1996},
  volume={7},
  pages={791-805}
}
In this paper, the LogP model is used to analyze four parallel sorting algorithms (bitonic, column, radix, and sample sort). LogP characterizes the performance of modern parallel machines with a small set of parameters: the communication latency ( ), overhead ( ), bandwidth ( ), and the number of processors ( ). We develop implementations of these algorithms in Split-C, a parallel extension to C, and compare the performance predicted by LogP to actual performance on a CM-5 of 32 to 512… CONTINUE READING
Highly Cited
This paper has 86 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 55 extracted citations

87 Citations

0510'95'00'06'12'18
Citations per Year
Semantic Scholar estimates that this publication has 87 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…