Merging multiple lists on hierarchical-memory multiprocessors

DOI10.1016/0743-7315(91)90022-2MaRDI QIDQ1177094zbMATH OpenOpenAlexFDO

Authors Peter J. Varman, Scott D. Scheufler, Balakrishna R. Iyer, Gary R. Ricard

Publication date 25 June 1992

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-7315(91)90022-2

zbMATH Keywords

partitioning algorithmmultiway merging

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• Parallel merging: Algorithm and implementation results
• An efficient multiway merging algorithm
• Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention
• Parallel comparison merging of many-ordered lists
• Publication:3334966

Cited in

(4)

• Parallel merging: Algorithm and implementation results
• Towards optimal range medians
• Perfectly load-balanced, stable, synchronization-free parallel merge
• Direct-chaining with coalescing lists

This page was built for publication: Merging multiple lists on hierarchical-memory multiprocessors

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