2026-09-20T00:36:41Zhttps://repository.rice.edu/server/oai/request

oai:repository.rice.edu:1911/1045422024-01-11T20:58:23Zcom_1911_8299col_1911_13110

Hirschberg, Daniel S. Sinclair, James B. Jump, J. Robert Kumar, Manoj 2018-12-18T21:25:10Z 2018-12-18T21:25:10Z 1981 Kumar, Manoj. "An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes." (1981) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/104542">https://hdl.handle.net/1911/104542</a>. https://hdl.handle.net/1911/104542 RICE2177 THESIS E.E. 1981 KUMAR 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 mXn/2 each, stored in an mXn 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. Next, 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 lln route steps and 2 log n compare-exchange steps to sort n elements stored in an nXn mesh-connected processor array. The previous best sorting algorithm requires 14 n route steps ( for practical values of n, 4 < n 512 ). 56 pp reformatted digital eng Copyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder. An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes Thesis Text Electrical Engineering Engineering Rice University Masters Master of Science open.access