Parallel sorting revisited
From MaRDI portal
Recommendations
Cited in
(30)- A parallel sorting scheme whose basic operation sortsN elements
- Sieve sorting algorithm
- Towards optimal parallel bucket sorting
- A randomized parallel sorting algorithm with an experimental study
- scientific article; zbMATH DE number 3938577 (Why is no real title available?)
- scientific article; zbMATH DE number 4074508 (Why is no real title available?)
- Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge
- Peculiarities of the parallel sorting algorithm with rank formation
- A note on adaptive parallel sorting
- scientific article; zbMATH DE number 1256741 (Why is no real title available?)
- Parallel distributive partitioned sorting methods
- Cubesort: A parallel algorithm for sorting N data items with S-sorters
- A strategy for parallel sorting algorithms evaluation based on MPI technology
- Parallel enumeration sort on OTIS-hypercube
- An efficient general in-place parallel sorting scheme
- Parallelism in tape-sorting
- Reordering for parallelism
- Parallel bimonotonic sorting
- Parallel Sorting with Serial Memories
- scientific article; zbMATH DE number 5997265 (Why is no real title available?)
- Conway's parallel sorting algorithm
- Sorting on OTIS-Networks
- Parallel sorting with cooperating heaps in a linear array of processors
- Sorting on a ring of processors
- Parallel methods for solving fundamental file rearrangement problems
- Parallel External Memory Suffix Sorting
- scientific article; zbMATH DE number 4070343 (Why is no real title available?)
- Simple randomized mergesort on parallel disks
- Tight Bounds on the Complexity of Parallel Sorting
- Overlapping computations, communications and I/O in parallel sorting
This page was built for publication: Parallel sorting revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315922)
