Journal of Computer Applications (计算机应用) 2013/33:12 PP.3339-3344
Large and very large matrix cannot be dealt by current matrix multiplication algorithms. With the development of MapReduce programming frame, parallel programs have become the main approaches for matrix computing. The matrix multiplication algorithms based on MapReduce were summarized, and an improved strategy for large matrix was proposed, which had a tradeoff in the data volume between the computation on single work node and the network transmission. The experimental results prove that the parallel algorithms outperform the traditional ones on the large matrix, and the performance will improve with the increase of the clusters.