Parallel quicksort
Abstract
This paper reports on the development of a parallel version of quicksort on a CRCW PRAM. The algorithm uses n processors and a linear space to sort n keys in the expected time O(log n) with large probability.
- Authors:
-
- Inst. of Technical Cybernetics, Slovac Academy of Sciences, Dubravska Cesta 9, 842-37 Bratislava (CS)
- Dept. of Computer Science, Univ. of California, Riverside, CA (US)
- Publication Date:
- OSTI Identifier:
- 5070982
- Resource Type:
- Journal Article
- Journal Name:
- Journal of Parallel and Distributed Computing; (United States)
- Additional Journal Information:
- Journal Volume: 11:4; Journal ID: ISSN 0743-7315
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; PARALLEL PROCESSING; ALGORITHMS; LINEAR PROGRAMMING; PERFORMANCE; MATHEMATICAL LOGIC; PROGRAMMING; 990200* - Mathematics & Computers
Citation Formats
Vrto, I, and Chelbus, B S. Parallel quicksort. United States: N. p., 1991.
Web.
Vrto, I, & Chelbus, B S. Parallel quicksort. United States.
Vrto, I, and Chelbus, B S. 1991.
"Parallel quicksort". United States.
@article{osti_5070982,
title = {Parallel quicksort},
author = {Vrto, I and Chelbus, B S},
abstractNote = {This paper reports on the development of a parallel version of quicksort on a CRCW PRAM. The algorithm uses n processors and a linear space to sort n keys in the expected time O(log n) with large probability.},
doi = {},
url = {https://www.osti.gov/biblio/5070982},
journal = {Journal of Parallel and Distributed Computing; (United States)},
issn = {0743-7315},
number = ,
volume = 11:4,
place = {United States},
year = {Mon Apr 01 00:00:00 EST 1991},
month = {Mon Apr 01 00:00:00 EST 1991}
}
Other availability
Save to My Library
You must Sign In or Create an Account in order to save documents to your library.