CPP11sort: A parallel quicksort based on C++ threading
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F22%3A00351004" target="_blank" >RIV/68407700:21240/22:00351004 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1002/cpe.6606" target="_blank" >https://doi.org/10.1002/cpe.6606</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/cpe.6606" target="_blank" >10.1002/cpe.6606</a>
Alternative languages
Result language
angličtina
Original language name
CPP11sort: A parallel quicksort based on C++ threading
Original language description
A new efficient implementation of the multi-threaded quicksort algorithm called CPP11sort is presented. This implementation is built exclusively upon the threading primitives of the C++ programming language itself. The performance of CPP11sort is evaluated and compared with its mainstream competitors provided by GNU, Intel, and Microsoft. It is shown that out of the considered implementations, CPP11sort mostly yields the shortest sorting times and is the only one that is portable to any conforming C++ implementation without a need of external libraries or non-standard compiler extensions. The experimental evaluation with various input data distributions resulted in parallel speedup between 16.1 and 44.2 on a 56-core server and between 6.8 and 14.5 on a 10-core workstation with enabled hyper-threading.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Research Center for Informatics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Concurrency and Computation: Practice and Experience
ISSN
1532-0626
e-ISSN
1532-0634
Volume of the periodical
34
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
11
Pages from-to
1-11
UT code for WoS article
000694000400001
EID of the result in the Scopus database
2-s2.0-85114513998