Parallel multithreaded deduplication of data sequences in nuclear structure calculations

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61389005%3A_____%2F24%3A00573716" target="_blank" >RIV/61389005:_____/24:00573716 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21240/24:00366916

Výsledek na webu

<a href="https://doi.org/10.1177/10943420231183697" target="_blank" >https://doi.org/10.1177/10943420231183697</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1177/10943420231183697" target="_blank" >10.1177/10943420231183697</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Parallel multithreaded deduplication of data sequences in nuclear structure calculations

Popis výsledku v původním jazyce

High performance computing (HPC) applications that work with redundant sequences of data can benefit from their deduplication. We study this problem on the symmetry-adapted no-core shell model (SA-NCSM), where redundant sequences of different kinds naturally emerge in the data of the basis of the Hilbert space physically relevant to a modeled nucleus. For a fast solution of this problem on multicore architectures, we propose and present three multithreaded algorithms, which employ either concurrent hash tables or parallel sorting methods. Furthermore, we present evaluation and comparison of these algorithms based on experiments performed with real-world SA-NCSM calculations. The results indicate that the fastest option is to use a concurrent hash table, provided that it supports sequences of data as a type of table keys. If such a hash table is not available, the algorithm based on parallel sorting is a viable alternative.

Název v anglickém jazyce

Parallel multithreaded deduplication of data sequences in nuclear structure calculations

Popis výsledku anglicky

High performance computing (HPC) applications that work with redundant sequences of data can benefit from their deduplication. We study this problem on the symmetry-adapted no-core shell model (SA-NCSM), where redundant sequences of different kinds naturally emerge in the data of the basis of the Hilbert space physically relevant to a modeled nucleus. For a fast solution of this problem on multicore architectures, we propose and present three multithreaded algorithms, which employ either concurrent hash tables or parallel sorting methods. Furthermore, we present evaluation and comparison of these algorithms based on experiments performed with real-world SA-NCSM calculations. The results indicate that the fastest option is to use a concurrent hash table, provided that it supports sequences of data as a type of table keys. If such a hash table is not available, the algorithm based on parallel sorting is a viable alternative.

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

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2024

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

International Journal of High Performance Computing Applications

ISSN

1094-3420

e-ISSN

1741-2846

Svazek periodika

38

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

12

Strana od-do

5-16

Kód UT WoS článku

001019649900001

EID výsledku v databázi Scopus

2-s2.0-85164177353