Extensions of the C++ Parallel STL library
Annales Mathematicae et Informaticae · 2026 · 63 · 122-131
DOI: 10.33039/ami.2026.06.007 ↗Kurz gefasst
Fachartikel in der Zeitschrift Annales Mathematicae et Informaticae, online erschienen am 17.07.2026. Verfasst von Zoltán Porkoláb und 1 weiteren Autor:innen.
Abstract (Originalsprache)
. C++17 introduced Parallel STL to simplify writing parallel code for developers already comfortable with the long-term used Standard Template Library. However, while Parallel STL can be powerful, it also presents risks: as many experts have noted, issues like non-commutative or non-associative algorithms can lead to unexpected results, and the standard offers plenty of other ways to “shoot yourself in the foot”. In this paper we discuss some of these traps, including the set of problems, where the answer must preserve the original order of the elements.We propose a generic filter-reduce algorithm for solving such parallel tasks. The algorithm is implemented on top of the Parallel STL itself, therefore it utilizes all of its benefits. Tests prove that filter-reduce is scalable and performs well on the specific set of problems.
Zitieren
APA
Porkoláb, Z., & Tóthvári, G. (2026). Extensions of the C++ Parallel STL library. Annales Mathematicae et Informaticae, 63, 122-131. https://doi.org/10.33039/ami.2026.06.007
Vancouver
Porkoláb Z, Tóthvári G. Extensions of the C++ Parallel STL library. Annales Mathematicae et Informaticae. 2026;63:122-131. doi:10.33039/ami.2026.06.007
BibTeX
@article{Porkolb2026,
author = {Porkoláb, Zoltán and Tóthvári, Gábor},
title = {Extensions of the C++ Parallel STL library},
journal = {Annales Mathematicae et Informaticae},
year = {2026},
volume = {63},
pages = {122--131},
doi = {10.33039/ami.2026.06.007}
}
EUVIMED