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

Simple item page
dc.contributor.advisorHirschberg, Daniel S.en_US
dc.contributor.committeeMemberSinclair, James B.en_US
dc.contributor.committeeMemberJump, J. Roberten_US
dc.creatorKumar, Manojen_US
dc.date.accessioned2018-12-18T21:25:10Zen_US
dc.date.available2018-12-18T21:25:10Zen_US
dc.date.issued1981en_US
dc.description.abstractAn 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 ).en_US
dc.format.digitalOriginreformatted digitalen_US
dc.format.extent56 ppen_US
dc.identifier.callnoTHESIS E.E. 1981 KUMARen_US
dc.identifier.citationKumar, 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>.en_US
dc.identifier.digitalRICE2177en_US
dc.identifier.urihttps://hdl.handle.net/1911/104542en_US
dc.language.isoengen_US
dc.rightsCopyright 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.en_US
dc.titleAn efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemesen_US
dc.typeThesisen_US
dc.type.materialTexten_US
thesis.degree.departmentElectrical Engineeringen_US
thesis.degree.disciplineEngineeringen_US
thesis.degree.grantorRice Universityen_US
thesis.degree.levelMastersen_US
thesis.degree.nameMaster of Scienceen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
RICE2177.pdf
Size:
1.29 MB
Format:
Adobe Portable Document Format
Download
Collections
Rice University Theses and Dissertations