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...

Full description

Saved in:
Bibliographic Details
Published in:Algorithms Vol. 18; no. 10; p. 655
Main Authors: Bouyukliev, Iliya, Bikov, Dushan, Pashinska-Gadzheva, Maria
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.10.2025
Subjects:
Algorithms
Analysis
Case studies
Coding theory
integer partition problem
Integers
Multiprocessing
OpenMP
Parallel processing
parallel programming
United Kingdom
ISSN:1999-4893, 1999-4893
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1999-4893
1999-4893
DOI:10.3390/a18100655