Jerry Lacmou Zeutouo ; Vianney Kengne Tchendji ; Jean-Frédéric Myoupo - Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem

arima:11217 - Revue Africaine de Recherche en Informatique et Mathématiques Appliquées, November 6, 2023, Volume 38 - Special issue CARI 2022 - 2023 - https://doi.org/10.46298/arima.11217
Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problemArticle

Authors: Jerry Zeutouo 1; Vianney Tchendji 1; Jean-Frédéric Myoupo ORCID2

  • 1 Unité de Recherche en Informatique Fondamentale, Ingénierie et Applications [Dschang]
  • 2 Modélisation, Information et Systèmes - UR UPJV 4290

Dynamic programming is a technique widely used to solve several combinatory optimization problems. A well-known example is the minimum cost parenthesizing problem (MPP), which is usually used to represent a class of non-serial polyadic dynamic-programming problems. These problems are characterized by a strong dependency between subproblems. This paper outlines a coarse-grained multicomputer parallel solution using the four-splitting technique to solve the MPP. It is a partitioning technique consisting of subdividing the dependency graph into subgraphs (or blocks) of variable size and splitting large-size blocks into four subblocks to avoid communication overhead caused by a similar partitioning technique in the literature. Our solution consists in evaluating a block by computing and communicating each subblock of this block to reduce the latency time of processors which accounts for most of the global communication time. It requires O(n^3/p) execution time with O(k * \sqrt{p}) communication rounds. n is the input data size, p is the number of processors, and k is the number of times the size of blocks is subdivided.


Volume: Volume 38 - Special issue CARI 2022 - 2023
Published on: November 6, 2023
Accepted on: October 27, 2023
Submitted on: April 19, 2023
Keywords: coarse-grained multicomputer,dynamic programming,dynamic graph,irregular partitioning,four-splitting,[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]

Consultation statistics

This page has been seen 112 times.
This article's PDF has been downloaded 38 times.