Modeling Parallel Sorts with LogP on the CM-5

@inproceedings{Dusseau1994ModelingPS,
  title={Modeling Parallel Sorts with LogP on the CM-5},
  author={Andrea Carol Dusseau},
  year={1994}
}
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 (L), overhead (o), bandwidth (g), and the number of processors (P ). 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

Similar Papers

Loading similar papers…