An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting Schemes
From MaRDI portal
Publication:3659156
DOI10.1109/TC.1983.1676217zbMath0513.68055MaRDI QIDQ3659156
Daniel S. Hirschberg, Manoj Kumar
Publication date: 1983
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
SIMD machines; mesh-connected processor arrays; linearly connected processor arrays; odd-even merge algorithm
Related Items
Randomized multipacket routing and sorting on meshes, A new parallel sorting algorithm based upon min-mid-max operations, Sorting in constant number of row and column phases on a mesh, VLSI-sorting evaluated under the linear model, Optimal routing algorithms for mesh-connected processor arrays, Parallel geometric algorithms on a mesh-connected computer, A parallel sorting scheme whose basic operation sortsN elements