Please use this identifier to cite or link to this item:
doi:10.22028/D291-40260 | Title: | Parallelized QuickSort with Optimal Speedup |
| Author(s): | Powers, David M. W. |
| Language: | English |
| Year of Publication: | 1990 |
| Place of publication: | Kaiserslautern |
| DDC notations: | 004 Computer science, internet |
| Publikation type: | Report |
| Abstract: | This paper introduces a parallel sorting algorithm based on QuickSort and having an n-input, n-processor, time complexity of O(log n) exhibited using a CRCW PRAM model. Although existing algorithms of similar complexity are known, this approach leads to a family of algorithms with a considerably lower constant. It is also significant in its close relationship to a standard sequential algorithm. |
| Link to this record: | urn:nbn:de:bsz:291--ds-402603 hdl:20.500.11880/36267 http://dx.doi.org/10.22028/D291-40260 |
| Series name: | SEKI-Report / Deutsches Forschungszentrum für Künstliche Intelligenz, DFKI [ISSN 1437-4447] |
| Series volume: | 90,9 |
| Date of registration: | 14-Aug-2023 |
| Faculty: | SE - Sonstige Einrichtungen |
| Department: | SE - DFKI Deutsches Forschungszentrum für Künstliche Intelligenz |
| Professorship: | SE - Sonstige |
| Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
| File | Description | Size | Format | |
|---|---|---|---|---|
| SEKI-Report-SR-90-09_Powers_Parallelized-QuickSort-with-Optimal-Speedup.pdf | 930,32 kB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.