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
Manoj Kumar, Daniel S. Hirschberg
Publication date: 1983
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
SIMD machinesmesh-connected processor arrayslinearly connected processor arraysodd-even merge algorithm
Related Items
Sorting in constant number of row and column phases on a mesh ⋮ A parallel sorting scheme whose basic operation sortsN elements ⋮ VLSI-sorting evaluated under the linear model ⋮ Optimal routing algorithms for mesh-connected processor arrays ⋮ Randomized multipacket routing and sorting on meshes ⋮ Parallel geometric algorithms on a mesh-connected computer ⋮ A new parallel sorting algorithm based upon min-mid-max operations