Welcome to the InfoSci Platform
Reference Hub6
An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem

An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem

Jean Frédéric Myoupo, Vianney Kengne Tchendji
Copyright: © 2014 |Volume: 6 |Issue: 2 |Pages: 27
ISSN: 1938-0259|EISSN: 1938-0267|EISBN13: 9781466654440|DOI: 10.4018/ijghpc.2014040105
Cite Article Cite Article

MLA

Myoupo, Jean Frédéric, and Vianney Kengne Tchendji. "An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem." IJGHPC vol.6, no.2 2014: pp.74-100. http://doi.org/10.4018/ijghpc.2014040105

APA

Myoupo, J. F. & Tchendji, V. K. (2014). An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem. International Journal of Grid and High Performance Computing (IJGHPC), 6(2), 74-100. http://doi.org/10.4018/ijghpc.2014040105

Chicago

Myoupo, Jean Frédéric, and Vianney Kengne Tchendji. "An Efficient CGM-Based Parallel Algorithm Solving the Matrix Chain Ordering Problem," International Journal of Grid and High Performance Computing (IJGHPC) 6, no.2: 74-100. http://doi.org/10.4018/ijghpc.2014040105

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

This study focuses on the parallel resolution of the matrix chain ordering problem and the optimal convex polygon triangulation problem on the Coarse grain multicomputer model (CGM for short). There has been intensive work on the parallelization of these dynamic programming problems in PRAM, including the use of systolic arrays, but a BSP/CGM solution is necessary for ease of implementation and portability. Our CGM algorithm is based on Yao's sequential solution running in O(n2) time and O(n2) space. This CGM algorithm uses p processors, each with O(n/p) local memory. It requires at most O(S/p×n2) running time with S communication rounds and with S/p<1. Our algorithm performs better than the algorithm proposed in 2012 by Dilson and Marco when S is less than n/p. We offer several ways of partitioning the problem to solve and study the impact of each partitioning algorithm performance. A CGM solution exists based on Yao's algorithm, but the subdivision of tasks is defined according to the BSP cost model. In this paper, we propose a solution based only on the CGM model specifications. Note that S is the number of super-steps of the CGM algorithm.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.