Strategies for Parallelization of Algorithms for Integer Partition

In this work we present strategies for parallelization of algorithms for representing integers as a sum of positive integers using OpenMP (Open Multi-Processing). We consider different types of algorithms—a non-recursive algorithm, a recursive algorithm and its modifications to introduce restriction...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Algorithms Ročník 18; číslo 10; s. 655
Hlavní autoři: Bouyukliev, Iliya, Bikov, Dushan, Pashinska-Gadzheva, Maria
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.10.2025
Témata:
Algorithms
Analysis
Case studies
Coding theory
integer partition problem
Integers
Multiprocessing
OpenMP
Parallel processing
parallel programming
United Kingdom
ISSN:1999-4893, 1999-4893
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In this work we present strategies for parallelization of algorithms for representing integers as a sum of positive integers using OpenMP (Open Multi-Processing). We consider different types of algorithms—a non-recursive algorithm, a recursive algorithm and its modifications to introduce restrictions on the number and size of the summands. Different strategies for their parallelization are presented. In order to evaluate the efficiency of the strategies, we consider both the execution times and the distribution of work among threads in the presented implementations.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a18100655