Parallel algorithms for merging and sorting
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3938577 (Why is no real title available?)
- scientific article; zbMATH DE number 3763288 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory Machines
- Finding the maximum, merging, and sorting in a parallel computation model
- Optimal parallel algorithms for computing convex hulls and for sorting
- Optimal parallel generation of a computation tree form
- Parallelism in Comparison Problems
- Routing, merging, and sorting on parallel models of computation
- Searching, Merging, and Sorting in Parallel Computation
Cited in
(12)- Simple randomized mergesort on parallel disks
- The parallel neighbour sort and 2-way merge algorithm
- scientific article; zbMATH DE number 6117286 (Why is no real title available?)
- scientific article; zbMATH DE number 4114045 (Why is no real title available?)
- Optimal parallel merging and sorting algorithms using \(\sqrt{N}\) processors without memory contention
- On parallel integer merging
- scientific article; zbMATH DE number 3868588 (Why is no real title available?)
- Perfectly load-balanced, stable, synchronization-free parallel merge
- 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
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)
