Skip to main content
. 2021 Feb 26;7:e395. doi: 10.7717/peerj-cs.395

Table 1. Summary of literature review.

SR# Title Techniques Limitations References
1 Genetic Algorithm Genetic Algorithm, Random Selection, Performance Matrices The Genetic Algorithm is the population base algorithm Mirjalili (2019)
2 Constrained Group Counseling Optimization Performance Matrices, Single-Objective Functions, Single-Objective Optimization Problems, Group Counseling Optimizer, Random Selection Used the Dominate Data Set, Social Problems of Human Eita & Fahmy (2010)
3 Experiments with a software component enabling NetSolve with direct communications in a non-intrusive and incremental way Expression based approach, Binary Tree Method The main issue of this approach is that the execution time increases for large grid matrix multiplications Zuo & Lastovetsky (2007)
4 Accelerating the dynamic programing for the matrix chain product on the GPU Dynamic Programming Approach It is time consuming because time varies with n3 here n is number of matrices Nishida, Ito & Nakano (2011)
5 Hama: An efficient matrix computation with the map reduce framework Map Reduce, Binary Tree The main issue of map reduce technique is that size of matrix does not fit in the memory and difficult to optimize the multi-way join operation in Map Key if the same number assigned to more attributes Seo et al. (2010)
6 Matrix-Chain Multiplication Using Greedy and Divide-Conquer approach Greedy Approach, Genetic Algorithm The greedy approach stuck at the local optimal and consider it global optimal Lakhotia et al. (2015)
7 A Chain-Multiplier for Large Scale Matrix Multiplication Systolic Approach, Dynamic Programming The main issue of this approach is that there are limited hardware resources Wei et al. (2017)
8 Matrix chain multiplication via multi-way join algorithms in Map Reduce Map Reduce framework Size of matrix does not fit in the memory Myung & Lee (2012)
9 Theoretical and Experimental Study of a Parallel Algorithm Solving the Matrix Chain Product Problem Three phase methodology based on dynamic programing Short matrix length the execution time is much larger Mabrouk, Hasni & Mahjoub (2017)