Optimal Sorting Algorithms for Parallel Computers.
CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
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.
- Computer Programming and Software
- Computer Hardware