An experimental analysis of parallel sorting algorithms

DOI10.1007/S002240000083zbMath0895.68066OpenAlexW2012255008WikidataQ127808125 ScholiaQ127808125MaRDI QIDQ1386651

D. Massart

Publication date: 26 May 1998

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000083

zbMATH Keywords

real parallel machines

Mathematics Subject Classification ID

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

Related Items (5)

Cache-Oblivious Iterated Predecessor Queries via Range Coalescing ⋮ Efficient sample sort and the average case analysis of PEsort ⋮ Efficient massively parallel implementation of some combinatorial algorithms ⋮ Parallel-vector algorithms for particle simulations on shared-memory multiprocessors ⋮ Application of fuzzy optimization to the orienteering problem

This page was built for publication: An experimental analysis of parallel sorting algorithms