A coarse-grained multicomputer algorithm for the longest common subsequence problem

Garcia, Thierry; Myoupo, Jean Frédéric; Sánchez‐Gómez, David

doi:10.1109/empdp.2003.1183610

Cited by 20 publications

(8 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are some CGM-based parallel algorithms for some problems modeled by dynamic programming among others: The longest common subsequence problem [3,4,8], the string editing problem [1]. The special case of MCOP (Matrix Chain Ordering Problem), OBST and OSPP (Optimal String Parenthesizing Problem) problems which are modeled by the same dynamic programming algorithm, each with its own specification, was tackled in [7,12,17].…”

Section: A Bsp/cgm Algorithm Consists In Alternating Local Computatiomentioning

confidence: 99%

Deriving CGM Based-Parallel Algorithms for the Optimal Binary Search-Tree Problem

Tchendji

Myoupo

Dequen

2016

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

show abstract

Section: A Bsp/cgm Algorithm Consists In Alternating Local Computatiomentioning

confidence: 99%

Deriving CGM Based-Parallel Algorithms for the Optimal Binary Search-Tree Problem

Tchendji

Myoupo

Dequen

2016

Advances in Intelligent Systems and Computing

View full text Add to dashboard Cite

show abstract

“…There are many CGM-based parallel algorithms for some dynamic programming problems, among others: The string editing problem [1], the longest common subsequence problem [2,3,12,28]. The special class of problems including matrix chain ordering problem (MCOP), OBST and optimal string parenthesizing problem (OSPP) which are solved by the same dynamic programming algorithm, each with its own specification, was tackled in [15,19,26,30].…”

Section: Literature Reviewmentioning

confidence: 99%

An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph

Tchendji

Zeutouo

2019

Data Sci. Eng.

View full text Add to dashboard Cite

The coarse-grained multicomputer parallel model (CGM for short) has been used for solving several classes of dynamic programming problems. In this paper, we propose a parallel algorithm on the CGM model, with p processors, for solving the optimal binary search tree problem (OBST problem), which is a polyadic non-serial dynamic programming problem. Firstly, we propose a dynamic graph model for solving the OBST problem and show that each instance of this problem corresponds to a one-to-all shortest path problem in this graph. Secondly, we propose a CGM parallel algorithm based on our dynamic graph to solve the OBST problem through one-to-all shortest paths in this graph. It uses our new technique of irregular partitioning of the dynamic graph to try to bring a solution to the well-known contradictory objectives of the minimization of the communication time and the load balancing of the processors in this type of graph. Our solution is based on Knuth's sequential solution and required O n 2 p time steps per processor and ⌈ √ 2p⌉ + k × �� ⌈ √ 2p⌉ 2 � + 1 � communication rounds. Integer k is a parameter used in the partitioning technique of our algorithm. This new CGM algorithm performs better than the previously most efficient solution, which uses regular partitioning of the tasks graph.

show abstract

“…This branch of research got its kick-off with Valiant [24] introducing the so-called Bulk Synchronous Parallel (BSP) machine, and was refined in different directions, for example, by Culler et al [6], LogP, and Dehne et al [9], CGM extensively studied in [8,12,[14][15][16].…”

Section: Introductionmentioning

confidence: 98%

A Coarse-Grained Multicomputer algorithm for the detection of repetitions

Garcia¹,

Sánchez‐Gómez²

2005

Information Processing Letters

View full text Add to dashboard Cite

A coarse-grained multicomputer algorithm for the longest common subsequence problem

Cited by 20 publications

References 25 publications

Deriving CGM Based-Parallel Algorithms for the Optimal Binary Search-Tree Problem

Deriving CGM Based-Parallel Algorithms for the Optimal Binary Search-Tree Problem

An Efficient CGM-Based Parallel Algorithm for Solving the Optimal Binary Search Tree Problem Through One-to-All Shortest Paths in a Dynamic Graph

A Coarse-Grained Multicomputer algorithm for the detection of repetitions

Contact Info

Product

Resources

About