Parallel algorithms for merging and sorting
From MaRDI portal
DOI10.1016/0020-0255(91)90028-SzbMATH Open0715.68018MaRDI QIDQ751797FDOQ751797
Authors: Narsingh Deo, Dilip Sarkar 
Publication date: 1991
Published in: Information Sciences (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Parallelism in Comparison Problems
- Routing, merging, and sorting on parallel models of computation
- Finding the maximum, merging, and sorting in a parallel computation model
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Optimal parallel algorithms for computing convex hulls and for sorting
- Title not available (Why is that?)
- Searching, Merging, and Sorting in Parallel Computation
- Optimal parallel generation of a computation tree form
- Title not available (Why is that?)
Cited In (12)
- Parallel algorithms for partitioning sorted sets and related problems
- A Pictorial Description of Cole’s Parallel Merge Sort
- AN EREW-PRAM MULTIPLE SEARCHING AND MERGING ALGORITHM
- AN EREW-PRAM MULTIPLE SEARCHING AND MERGING ALGORITHM
- Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention
- On parallel integer merging
- Title not available (Why is that?)
- Perfectly load-balanced, stable, synchronization-free parallel merge
- The parallel neighbour sort and 2-way merge algorithm
- Simple randomized mergesort on parallel disks
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Parallel algorithms for merging and sorting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751797)
