The parallel odd-even merge algorithm

DOI10.1080/00207168608803494zbMath0655.68076OpenAlexW2005401000MaRDI QIDQ3802635

Nadia Y. Yousif, David J. Evans

Publication date: 1986

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168608803494

zbMATH Keywords

computational complexityodd-even mergeMIMDparallel pathsneighbour sortsorted subsetsstatic/dynamic performance overheads

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25)

Related Items (1)

Merging by the parallel binary search algorithm

Cites Work

• Optimal Sorting Algorithms for Parallel Computers

This page was built for publication: The parallel odd-even merge algorithm