The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (1979 vol.28)
pp: 2-7
D. Nassimi , Department of Computer Science, University of Minnesota
ABSTRACT
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
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, January 1979, doi:10.1109/TC.1979.1675216
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool