Parallel quicksort

Journal Article · Mon Apr 01 00:00:00 EST 1991 · Journal of Parallel and Distributed Computing; (United States)

OSTI ID:5070982

Vrto, I ^[1]; Chelbus, B S ^[2]

---

1. Inst. of Technical Cybernetics, Slovac Academy of Sciences, Dubravska Cesta 9, 842-37 Bratislava (CS)
2. Dept. of Computer Science, Univ. of California, Riverside, CA (US)

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.

• OSTI ID: 5070982
• Journal Information: Journal of Parallel and Distributed Computing; (United States), Vol. 11:4; ISSN 0743-7315
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PARALLEL PROCESSING
ALGORITHMS
LINEAR PROGRAMMING
PERFORMANCE
MATHEMATICAL LOGIC
PROGRAMMING
990200* - Mathematics & Computers