An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
Issue No. 03 - March (1983 vol. 32)
M. Kumar , Department of Electrical Engineering, Rice University
An algorithm is presented to merge two subfiles of size n/2 each, stored in the left and the right halves of a linearly connected processor array, in 3n/2 route steps and log n compare-exchange steps. This algorithm is extended to merge two horizontally adjacent subfiles of size m ? n/2 each, stored in an m ? n mesh-connected processor array in row-major order, in m + 2n route steps and log mn compare-exchange steps. These algorithms are faster than their counterparts proposed so far.
SIMD machines, Linearly connected processor arrays, mesh-connected processor arrays, odd-even merge algorithm
M. Kumar and D. Hirschberg, "An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes," in IEEE Transactions on Computers, vol. 32, no. , pp. 254-264, 1983.