Merging on the BSP model

DOI10.1016/S0167-8191(00)00104-6MaRDI QIDQ5940993zbMATH OpenOpenAlexFDO

Authors A. V. Gerbessiotis, C. J. Siniolakis

Publication date 20 August 2001

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(00)00104-6

zbMATH Keywords

bulk-synchronous parallel model

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Space-efficient parallel merging
• Direct bulk-synchronous parallel algorithms
• On parallel integer merging
• Optimal merging and sorting on the EREW PRAM
• The performance of a selection of sorting algorithms on a general purpose parallel computer

Cited in

(7)

• Parallel merging with restriction
• Randomized selection in \(n+C+o(n)\) comparisons
• The bulk-synchronous parallel random access machine
• An architecture independent study of parallel segment trees
• Perfectly load-balanced, stable, synchronization-free parallel merge
• The performance of a selection of sorting algorithms on a general purpose parallel computer
• Integer merging on EREW PRAM

This page was built for publication: Merging on the BSP model

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