An optimal parallel algorithm for merging using multiselection

DOI10.1016/0020-0190(94)00009-3zbMath0808.68062OpenAlexW2044031350MaRDI QIDQ1322118

Narsingh Deo, Muralidhar Medidi, Amit Kumar Jain

Publication date: 9 June 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00009-3

zbMATH Keywords

optimal parallel algorithmscalable parallel algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (3)

Perfectly Load-Balanced, Stable, Synchronization-Free Parallel Merge ⋮ Integer merging on EREW PRAM ⋮ Parallel merging with restriction

Cites Work

• Optimal merging and sorting on the EREW PRAM
• Parallel merging: Algorithm and implementation results
• Parallel approximation algorithms for bin packing
• The complexity of selection and ranking in X+Y and matrices with sorted columns
• Parallel Merge Sort
• Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
• Finding the maximum, merging, and sorting in a parallel computation model
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal parallel algorithm for merging using multiselection