Back to Search Start Over

Exploiting inter-operation parallelism for matrix chain multiplication using MapReduce.

Authors :
Myung, Jaeseok
Lee, Sang-goo
Source :
Journal of Supercomputing. Oct2013, Vol. 66 Issue 1, p594-609. 16p.
Publication Year :
2013

Abstract

In this paper, we address the matrix chain multiplication problem, i.e., the multiplication of several matrices. Although several studies have investigated the problem, our approach has some different points. First, we propose MapReduce algorithms that allow us to provide scalable computation for large matrices. Second, we transform the matrix chain multiplication problem from sequential multiplications of two matrices into a single multiplication of several matrices. Since matrix multiplication is associative, this approach helps to improve the performance of the algorithms. To implement the idea, we adopt multi-way join algorithms in MapReduce that have been studied in recent years. In our experiments, we show that the proposed algorithms are fast and scalable, compared to several baseline algorithms. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
09208542
Volume :
66
Issue :
1
Database :
Academic Search Index
Journal :
Journal of Supercomputing
Publication Type :
Academic Journal
Accession number :
90471774
Full Text :
https://doi.org/10.1007/s11227-013-0936-5