The parallel odd-even merge algorithm
From MaRDI portal
Publication:3802635
DOI10.1080/00207168608803494zbMath0655.68076MaRDI QIDQ3802635
David J. Evans, Nadia Y. Yousif
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
computational complexity; odd-even merge; MIMD; parallel paths; neighbour sort; sorted subsets; static/dynamic performance overheads
68Q25: Analysis of algorithms and problem complexity
68P10: Searching and sorting
68N25: Theory of operating systems
Related Items
Cites Work