Pure C++ Approach to Optimized Parallel Traversal of Regular Data Structures

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F24%3A10481450" target="_blank" >RIV/00216208:11320/24:10481450 - isvavai.cz</a>

Result on the web

<a href="https://doi.org/10.1145/3649169.3649247" target="_blank" >https://doi.org/10.1145/3649169.3649247</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1145/3649169.3649247" target="_blank" >10.1145/3649169.3649247</a>

Result language

angličtina

Original language name

Pure C++ Approach to Optimized Parallel Traversal of Regular Data Structures

Original language description

Many computational problems consider memory throughput a performance bottleneck. The problem becomes even more pronounced in the case of parallel platforms, where the ratio between computing elements and memory bandwidth shifts towards computing. Software needs to be attuned to hardware features like cache architectures or memory banks to reach a decent level of performance efficiency. This can be achieved by selecting the right memory layouts for data structures or changing the order of data structure traversal. In this work, we present an abstraction for traversing a set of regular data structures (e.g., multidimensional arrays) that allows the design of traversal-agnostic algorithms. Such algorithms can be adjusted for particular memory layouts of the data structures, semi-automated parallelization, or auto-tuning without altering their internal code. The proposed solution was implemented as an extension of the Noarr library that simplifies a layout-agnostic design of regular data structures. It is implemented entirely using C++ template meta-programming without any nonstandard dependencies, so it is fully compatible with existing compilers, including CUDA NVCC. We evaluate the performance and expressiveness of our approach on the Polybench-C benchmarks.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

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

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2024

Confidentiality

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

Article name in the collection

Proceedings of the 15th International Workshop on Programming Models and Applications for Multicores and Manycores

ISBN

979-8-4007-0599-1

ISSN

—

e-ISSN

—

Number of pages

10

Pages from-to

42-51

Publisher name

Association for Computing Madinery

Place of publication

New York, NY, USA

Event location

Edinburgh

Event date

Mar 3, 2024

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

001182171800005