On the versatility of parallel sorting by regular sampling

DOI10.1016/0167-8191(93)90019-HMaRDI QIDQ1315927zbMATH OpenOpenAlexFDO

Authors Paul Lu, Jonathan Schaeffer, John Shillington, Pok Sze Wong, Hanmao Shi, Xiaobo 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)

Recommendations

• Parallel sorting by regular sampling
• An efficient parallel sorting algorithm
• An experimental analysis of parallel sorting algorithms
• scientific article; zbMATH DE number 1760033
• An efficient parallel sorting algorithm for shared memory multiprocessors

Cited in

(16)

• Parallel string sample sort
• A randomized parallel sorting algorithm with an experimental study
• Power balance and apportionment algorithms for the United States Congress
• Efficient sample sort and the average case analysis of PEsort
• An efficient parallel sorting compatible with the standard qsort
• Robust massively parallel sorting
• Fast sort of floating-point data for data engineering
• Partitioned parallel radix sort
• Optimal Parallel Sorting Scheme by Order Statistics
• An efficient general in-place parallel sorting scheme
• Scalable distributed string sorting
• The bulk-synchronous parallel random access machine
• Parallel sorting by regular sampling
• Algorithms – ESA 2004
• scientific article; zbMATH DE number 1760033 (Why is no real title available?)
• Skeleton composition versus stable process systems in Eden

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315927)