Parallel algorithms for merging and sorting
From MaRDI portal
Publication:751797
DOI10.1016/0020-0255(91)90028-SzbMath0715.68018MaRDI QIDQ751797
Publication date: 1991
Published in: Information Sciences (Search for Journal in Brave)
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