On the versatility of parallel sorting by regular sampling

DOI10.1016/0167-8191(93)90019-HzbMath0788.68034OpenAlexW1964424852MaRDI QIDQ1315927

John Shillington, Paul Lu, Jonathan Schaeffer, Pok Sze Wong, Hanmao Shi, Xiao-bo Li

Publication date: 18 April 1994

Published in: Parallel Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-8191(93)90019-h

zbMATH Keywords

network of workstationsparallel sorting algorithmsparallel sorting by regular samplingshared memory architectures

Mathematics Subject Classification ID

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

Related Items (3)

The bulk-synchronous parallel random access machine ⋮ Fast sort of floating-point data for data engineering ⋮ Skeleton composition versus stable process systems in Eden

This page was built for publication: On the versatility of parallel sorting by regular sampling