Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge

DOI10.1007/BF01952679zbMath0677.68055MaRDI QIDQ1123621

Michael J. Quinn

Publication date: 1989

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

sortingparallel algorithmhypercube multicomputer

Mathematics Subject Classification ID

Searching and sorting (68P10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Theory of software (68N99)

Uses Software

• Quicksort

Cites Work

• Unnamed Item
• Parallel sorting algorithms for tightly coupled multiprocessors
• Parallel Matrix and Graph Algorithms
• Implementing Quicksort programs

This page was built for publication: Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge