CPP11sort: A parallel quicksort based on C++ threading

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

CPP11sort: A parallel quicksort based on C++ threading

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

CPP11sort: A parallel quicksort based on C++ threading

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Výzkumné centrum informatiky</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Concurrency and Computation: Practice and Experience

ISSN

1532-0626

e-ISSN

1532-0634

Svazek periodika

34

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

11

Strana od-do

1-11

Kód UT WoS článku

000694000400001

EID výsledku v databázi Scopus

2-s2.0-85114513998