Parallel sorting by regular sampling

DOI10.1016/0743-7315(92)90075-XzbMath0763.68030OpenAlexW2092574257MaRDI QIDQ1200122

Jonathan Schaeffer, Hanmao Shi

Publication date: 17 January 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(92)90075-x

zbMATH Keywords

parallel sorting algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (10)

PARALLEL ALGORITHMS FOR MAPPING SHORT DEGENERATE AND WEIGHTED DNA SEQUENCES TO A REFERENCE GENOME ⋮ A randomized sorting algorithm on the BSP model ⋮ The bulk-synchronous parallel random access machine ⋮ A bridging model for multi-core computing ⋮ A parallel computing framework for big data ⋮ Scalable Parallel Suffix Array Construction ⋮ A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions ⋮ Parallel Sorting for GPUs ⋮ On the scalability of PSRS algorithm ⋮ A time-space optimal parallel sorting on a hypercube

This page was built for publication: Parallel sorting by regular sampling