A logarithmic time sort for linear size networks
Journal of the ACM (JACM)
An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
The input/output complexity of sorting and related problems
Communications of the ACM
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
A guided tour of Chernoff bounds
Information Processing Letters
Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Randomized sorting and selection on mesh-connected processor arrays (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Matching the bisection bound for routing and sorting on the mesh
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Implementations of randomized sorting on large parallel machines
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Direct bulk-synchronous parallel algorithms
Journal of Parallel and Distributed Computing
SIAM Journal on Computing
Derandomizing algorithms for routing and sorting on meshes
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Samplesort: A Sampling Approach to Minimal Storage Tree Sorting
Journal of the ACM (JACM)
Approximate and Exact Deterministic Parallel Selection
MFCS '93 Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
| Hi-index | 5.23 |
In this paper, a refined deterministic sampling strategy is presented. It allows to improve the performance of deterministic sample-sort algorithms to the point that they can compete with their randomized counterparts. The method is illustrated by a detailed analysis for the cases of sorting on meshes and for sorting in external memory on a single processor machine.