This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
March 1983 (vol. 32 no. 3)
pp. 254-264
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.
Index Terms:
SIMD machines, Linearly connected processor arrays, mesh-connected processor arrays, odd-even merge algorithm
Citation:
M. Kumar, D.S. Hirschberg, "An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes," IEEE Transactions on Computers, vol. 32, no. 3, pp. 254-264, March 1983, doi:10.1109/TC.1983.1676217
Usage of this product signifies your acceptance of the Terms of Use.