Parallel merging: Algorithm and implementation results

DOI10.1016/0167-8191(90)90040-GMaRDI QIDQ916383zbMATH OpenOpenAlexFDO

Authors Peter J. Varman, Balakrishna R. Iyer, Donald J. Haderle, Stephen M. Dunn

Publication date 1990

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(90)90040-g

zbMATH Keywords

complexity analysissorting algorithmsparallel mergingshared memory multiprocessorImplementation results

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• Merging multiple lists on hierarchical-memory multiprocessors
• Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention
• scientific article; zbMATH DE number 3868588
• scientific article; zbMATH DE number 3949727
• Parallel comparison merging of many-ordered lists

Cited in

(10)

• Integer merging on EREW PRAM
• scientific article; zbMATH DE number 6117286 (Why is no real title available?)
• Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention
• A parallel partition for enhanced parallel QuickSort
• On parallel integer merging
• Perfectly load-balanced, stable, synchronization-free parallel merge
• An optimal parallel algorithm for merging using multiselection
• A study on interleaving versus segmentation
• AN EREW-PRAM MULTIPLE SEARCHING AND MERGING ALGORITHM
• AN EREW-PRAM MULTIPLE SEARCHING AND MERGING ALGORITHM

This page was built for publication: Parallel merging: Algorithm and implementation results

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