Parallel quicksort

Bogdan S. Chlebus, Imrich Vrťo

Research output: Contribution to journalArticle

Abstract

A parallel version of quicksort on a CRCW PRAM is developed. The algorithm uses n processors and a linear space to sort n keys in the expected time O(log n) with large probability.

Original languageEnglish (US)
Pages (from-to)332-337
Number of pages6
JournalJournal of Parallel and Distributed Computing
Volume11
Issue number4
DOIs
StatePublished - Apr 1991
Externally publishedYes

Fingerprint

Quicksort
Linear Space
Sort

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Cite this

Parallel quicksort. / Chlebus, Bogdan S.; Vrťo, Imrich.

In: Journal of Parallel and Distributed Computing, Vol. 11, No. 4, 04.1991, p. 332-337.

Research output: Contribution to journalArticle

Chlebus, Bogdan S. ; Vrťo, Imrich. / Parallel quicksort. In: Journal of Parallel and Distributed Computing. 1991 ; Vol. 11, No. 4. pp. 332-337.
@article{c7d27f7b42984d9eb10a021f29205fe7,
title = "Parallel quicksort",
abstract = "A parallel version of quicksort on a CRCW PRAM is developed. The algorithm uses n processors and a linear space to sort n keys in the expected time O(log n) with large probability.",
author = "Chlebus, {Bogdan S.} and Imrich Vrťo",
year = "1991",
month = "4",
doi = "10.1016/0743-7315(91)90040-G",
language = "English (US)",
volume = "11",
pages = "332--337",
journal = "Journal of Parallel and Distributed Computing",
issn = "0743-7315",
publisher = "Academic Press Inc.",
number = "4",

}

TY - JOUR

T1 - Parallel quicksort

AU - Chlebus, Bogdan S.

AU - Vrťo, Imrich

PY - 1991/4

Y1 - 1991/4

N2 - A parallel version of quicksort on a CRCW PRAM is developed. The algorithm uses n processors and a linear space to sort n keys in the expected time O(log n) with large probability.

AB - A parallel version of quicksort on a CRCW PRAM is developed. The algorithm uses n processors and a linear space to sort n keys in the expected time O(log n) with large probability.

UR - http://www.scopus.com/inward/record.url?scp=0026135694&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026135694&partnerID=8YFLogxK

U2 - 10.1016/0743-7315(91)90040-G

DO - 10.1016/0743-7315(91)90040-G

M3 - Article

AN - SCOPUS:0026135694

VL - 11

SP - 332

EP - 337

JO - Journal of Parallel and Distributed Computing

JF - Journal of Parallel and Distributed Computing

SN - 0743-7315

IS - 4

ER -