Theoretical and Experimental Study of a Parallel Algorithm Solving the Matrix Chain Product Problem

We are interested in the matrix chain product problem that may be solved by a well known dynamic programming algorithm (DPA) a so-called polyhedral algorithm i.e. structured in a (three) DO-loop nest (3-DLN). We propose a parallelization approach by choosing a fine grain task segmentation of the 3-D...

Full description

Saved in:
Bibliographic Details
Published inProceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA) pp. 341 - 347
Main Authors Mabrouk, Bchira Ben, Hasni, Hamadi, Mahjoub, Zaher
Format Conference Proceeding
LanguageEnglish
Published Athens The Steering Committee of The World Congress in Computer Science, Computer Engineering and Applied Computing (WorldComp) 01.01.2017
Subjects
Online AccessGet full text

Cover

Loading…