255- https://doi.org/10.1109/tc.1979.1675216
Bitonic Sort on a Mesh-Connected Parallel Computer
- Jan 1, 1979
- IEEE Transactions on Computers
- Nassimi +1 more
Abstract
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-dimensional processor array are discussed.
- # Bitonic Sort
- # Batcher's Bitonic Sort
- # Mesh-Connected Parallel Computer
- # Mesh-connected Processor Array
- # Row-major Order
- # Processor Array
- # Mesh-Connected Parallel
- # Mesh-connected Processor
- # Parallel Computer
