The Saukas-Song Selection Algorithm and Coarse Grained Parallel Sorting
share
We analyze the running time of the Saukas-Song algorithm for selection on a coarse grained multicomputer without expressing the running time in terms of communication rounds. We derive sorting algorithms that are asymptotically optimal for restricted ranges of processors on coarse grained multicomputers.
READ FULL TEXT