The Community for Technology Leaders
Green Image
Issue No. 01 - January (1979 vol. 28)
ISSN: 0018-9340
pp: 2-7
D. Nassimi , Department of Computer Science, University of Minnesota
An O(n) algorithm to sort n<sup>2</sup>elements on an Illiac IV-like n ? n mesh-connected processor array is presented. This algorithm sorts the n<sup>2</sup>elements 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 n<sup>2</sup>elements into snake-like row-major order. Extensions to the case of a j-dimensi
SIMD machine, Bitonic sort, complexity, mesh-connected parallel computer, parallel sorting

D. Nassimi and S. Sahni, "Bitonic Sort on a Mesh-Connected Parallel Computer," in IEEE Transactions on Computers, vol. 28, no. , pp. 2-7, 1979.
89 ms
(Ver 3.3 (11022016))