A Parallel Quicksort Algorithm

A Parallel Quicksort Algorithm

An optimal parallel version of quicksort, pquicksort, is presented and analyzed. The algorithm is designed for a p-processor MIMD (multiple instruction, multiple data) machine with shared memory and is an exclusive read, exclusive write algorithm. It is shown that in almost all permutations of N val...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of parallel and distributed computing 1993-10, Vol.19 (2), p.83-89
Hauptverfasser: Brown, T., Xiong, R.B.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Distributed computer systems
Electronics
Exact sciences and technology
Hardware
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An optimal parallel version of quicksort, pquicksort, is presented and analyzed. The algorithm is designed for a p-processor MIMD (multiple instruction, multiple data) machine with shared memory and is an exclusive read, exclusive write algorithm. It is shown that in almost all permutations of N values (with probability 1 - o(1/ N)) pquicksort will sort in O( N lg N/ p) for p ≤ N/lg N.
ISSN:0743-7315
1096-0848
DOI:10.1006/jpdc.1993.1093