The parallel odd-even merge algorithm

DOI10.1080/00207168608803494MaRDI QIDQ3802635zbMATH OpenOpenAlexFDO

Authors Nadia Y. Yousif, D. 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 complexityMIMDneighbour sortodd-even mergeparallel pathssorted subsetsstatic/dynamic performance overheads

Mathematics Subject Classification ID

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

Cites work

• Optimal Sorting Algorithms for Parallel Computers

Cited in

(4)

• The parallel neighbour sort and 2-way merge algorithm
• scientific article; zbMATH DE number 6117286 (Why is no real title available?)
• Merging by the parallel binary search algorithm
• On parallel integer merging

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3802635)