This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Bitonic Sort on a Mesh-Connected Parallel Computer
January 1979 (vol. 28 no. 1)
pp. 2-7
D. Nassimi, Department of Computer Science, University of Minnesota
An O(n) algorithm to sort n2elements on an Illiac IV-like n ? n mesh-connected processor array is presented. This algorithm sorts the n2elements into row-major order and is an adaptation of Batcher's bitonic sort. A slight modification of our algorithm yields an O(n) algorithm to sort n2elements into snake-like row-major order. Extensions to the case of a j-dimensi
Index Terms:
SIMD machine, Bitonic sort, complexity, mesh-connected parallel computer, parallel sorting
Citation:
D. Nassimi, S. Sahni, "Bitonic Sort on a Mesh-Connected Parallel Computer," IEEE Transactions on Computers, vol. 28, no. 1, pp. 2-7, Jan. 1979, doi:10.1109/TC.1979.1675216
Usage of this product signifies your acceptance of the Terms of Use.