An experimental analysis of parallel sorting algorithms
From MaRDI portal
Recommendations
Cited in
(21)- Cache-oblivious iterated predecessor queries via range coalescing
- Parallel-vector algorithms for particle simulations on shared-memory multiprocessors
- A randomized parallel sorting algorithm with an experimental study
- Analysis of the performance of the parallel quicksort method
- On the versatility of parallel sorting by regular sampling
- Sorting algorithms on transputer arrays
- Analyzing a class of distributive partitioning sort algorithms
- An efficient general in-place parallel sorting scheme
- Application of fuzzy optimization to the orienteering problem
- scientific article; zbMATH DE number 4070343 (Why is no real title available?)
- scientific article; zbMATH DE number 1760033 (Why is no real title available?)
- Overlapping computations, communications and I/O in parallel sorting
- Sorting on STAR
- Efficient massively parallel implementation of some combinatorial algorithms
- Efficient sample sort and the average case analysis of PEsort
- Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge
- A strategy for parallel sorting algorithms evaluation based on MPI technology
- An experimental study of sorting and branch prediction
- Timing results of some internal sorting algorithms on the ETA 10-P
- Timing results of some internal sorting algorithms on vector computers
- A benchmark parallel sort for shared memory multiprocessors
This page was built for publication: An experimental analysis of parallel sorting algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386651)
