Porkoláb, Zoltán and Tóthvári, Gábor (2026) Extensions of the C++ Parallel STL library. ANNALES MATHEMATICAE ET INFORMATICAE, 63. pp. 122-131. ISSN 1787-6117
|
Text
122_131.pdf - Published Version Download (574kB) | Preview |
Abstract
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 nonassociative 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.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | C++, ParSTL, parallel algorithms |
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika > QA76 Computer software / programozás |
| Depositing User: | Tibor Gál |
| Date Deposited: | 22 Jul 2026 07:27 |
| Last Modified: | 22 Jul 2026 07:27 |
| URI: | https://real.mtak.hu/id/eprint/242825 |
Actions (login required)
![]() |
Edit Item |




