http://worldcat.org/entity/work/id/137119054

Optimal sorting algorithms for parallel computers

The problem of sorting a sequence of n elements on a parallel computer with k processors is considered. The algorithms the authors present can all be run on a single instruction stream multiple data stream computer. For large n, each achieves an asymptotic speed-up ratio of k with respect to the best sequential algorithm. This linear (in k) speed-up is optimal in the number of processors used.

Open All Close All