This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimal Sorting Algorithms for Parallel Computers
January 1978 (vol. 27 no. 1)
pp. 84-87
G. Baudet, Carnegie-Mellon University, Deparwment of Computer Science
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.
Index Terms:
sorting algorithms, Comparison/exchange, optimal speed-up ratio, parallel algorithms, parallel computers
Citation:
G. Baudet, D. Stevenson, "Optimal Sorting Algorithms for Parallel Computers," IEEE Transactions on Computers, vol. 27, no. 1, pp. 84-87, Jan. 1978, doi:10.1109/TC.1978.1674957
Usage of this product signifies your acceptance of the Terms of Use.