Analysis of the performance of the parallel quicksort method

DOI10.1007/BF01934992zbMath0585.68063OpenAlexW2005452796MaRDI QIDQ1070824

Nadia Y. Yousif, David J. Evans

Publication date: 1985

Published in: BIT (Search for Journal in Brave)

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

zbMATH Keywords

parallel computationlinear insertionpartitioning processperformance on a parallel MIMD computerquicksort algorithmspeed up rate

Mathematics Subject Classification ID

Searching and sorting (68P10) Theory of operating systems (68N25) Algorithms in computer science (68W99)

Uses Software

• Quicksort
• Find

Cites Work

• Unnamed Item
• The parallel quicksort algorithm part i–run time analysis
• The parallel quicksort algorithm part 2—simulation
• Implementing Quicksort programs
• Quicksort

This page was built for publication: Analysis of the performance of the parallel quicksort method