Accéder directement au contenu Accéder directement à la navigation
Nouvelle interface
Communication dans un congrès

Coarse-grained multicomputer parallel algorithm using the four-splitting technique for the minimum cost parenthesizing problem

Abstract : 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.
Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-03712194
Contributeur : Jerry LACMOU ZEUTOUO Connectez-vous pour contacter le contributeur
Soumis le : samedi 2 juillet 2022 - 16:14:22
Dernière modification le : vendredi 5 août 2022 - 11:22:19
Archivage à long terme le : : lundi 3 octobre 2022 - 18:32:16

Fichier

cari-mpp_4s_cgm-accepted.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-03712194, version 1

Collections

Citation

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. CARI 2022 - Colloque Africain pour la Recherche en Informatique et Mathématiques Appliquées, Oct 2022, Yaoundé, Cameroon. ⟨hal-03712194⟩

Partager

Métriques

Consultations de la notice

35

Téléchargements de fichiers

2