Efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes

Journal Article · Tue Mar 01 04:00:00 EST 1983 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1983.1676217· OSTI ID:5140174

Kumar, M; Hirschberg, D S

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. Also an algorithm is presented to merge two vertically aligned subfiles, stored in a mesh-connected processor array in row-major order. Finally, a sorting scheme is proposed that requires 11n route steps and 2 log/sup 2/ n compare-exchange steps to sort n/sup 2/ elements stored in an n*n mesh-connected processor array. The merge algorithms for the mesh-connected processor array use wrap around connections. These connections can be avoided at the expense of some extra hardware. 12 references.

• Research Organization: Rice Univ., Houston, TX
• OSTI ID: 5140174
• Journal Information: IEEE Trans. Comput.; (United States), Journal Name: IEEE Trans. Comput.; (United States) Vol. 3; ISSN ITCOB
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
COMPUTERS
MATHEMATICAL LOGIC
PARALLEL PROCESSING
PROGRAMMING