Parallel merging: Algorithm and implementation results

From MaRDI portal

Publication:916383

Jump to:navigation, search

DOI10.1016/0167-8191(90)90040-GzbMath0703.68056OpenAlexW1992402172MaRDI QIDQ916383

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

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 analysis sorting algorithms parallel merging shared memory multiprocessor Implementation results

Mathematics Subject Classification ID

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

Related Items (max. 100)

Perfectly Load-Balanced, Stable, Synchronization-Free Parallel Merge ⋮ AN EREW-PRAM MULTIPLE SEARCHING AND MERGING ALGORITHM ⋮ AN EREW-PRAM MULTIPLE SEARCHING AND MERGING ALGORITHM ⋮ Integer merging on EREW PRAM ⋮ An optimal parallel algorithm for merging using multiselection

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:916383&oldid=12883654"