Parallel algorithms for merging and sorting

DOI10.1016/0020-0255(91)90028-SzbMath0715.68018MaRDI QIDQ751797

Narsingh Deo, Dilip Sarkar

Publication date: 1991

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

CREW PRAMEREW PRAMparallel merging and sorting

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal parallel algorithms for computing convex hulls and for sorting
• Routing, merging, and sorting on parallel models of computation
• Searching, Merging, and Sorting in Parallel Computation
• Optimal parallel generation of a computation tree form
• Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
• Finding the maximum, merging, and sorting in a parallel computation model
• Parallelism in Comparison Problems

This page was built for publication: Parallel algorithms for merging and sorting