Title :
Optimal Sorting Algorithms for Parallel Computers
Author :
Baudet, Gérard ; Stevenson, David
Author_Institution :
Carnegie-Mellon University, Deparwment of Computer Science
Abstract :
The problem of sorting a sequence of n elements on a parallel computer with k processors is considered. The algorithms we 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, which is optimal in the number of processors used.
Keywords :
Comparison/exchange; optimal speed-up ratio; parallel algorithms; parallel computers; sorting algorithms; Algorithm design and analysis; Computer aided instruction; Concurrent computing; Contracts; Integrated circuit interconnections; Joining processes; Merging; Parallel algorithms; Routing; Sorting; Comparison/exchange; optimal speed-up ratio; parallel algorithms; parallel computers; sorting algorithms;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.1978.1674957
