A benchmark parallel sort for shared memory multiprocessors

DOI10.1109/12.9738zbMath0663.68079OpenAlexW2051374083MaRDI QIDQ3814825

Ian Mathieson, R. S. Francis

Publication date: 1988

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/12.9738

zbMATH Keywords

sortingperformance analysisparallel algorithmsconcurrent programmingshared memory MIMD multiprocessors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Theory of operating systems (68N25) Theory of software (68N99)

Related Items (2)

AN EFFICIENT PARALLEL SORTING COMPATIBLE WITH THE STANDARD QSORT ⋮ KWTA networks and their applications

This page was built for publication: A benchmark parallel sort for shared memory multiprocessors