Parallel sorting algorithms for tightly coupled multiprocessors

DOI10.1016/0167-8191(88)90075-0zbMath0645.68070OpenAlexW2073860632MaRDI QIDQ1103408

Michael J. Quinn

Publication date: 1988

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

Full work available at URL: https://doi.org/10.1016/0167-8191(88)90075-0

zbMATH Keywords

timingsorting algorithmsshared memory multiprocessorquickmergeparallel quicksortparallel shellsort

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of software (68N99)

Related Items (2)

Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge ⋮ Finding the closest extreme vertex to a fixed point

This page was built for publication: Parallel sorting algorithms for tightly coupled multiprocessors