Analysis and Comparison of Several Parallel Algorithms for Matrix Multiplication on Distributed-memory Multi-computer

After introducing several parallel algorithms for matrix multiplication, the paper presents the time complexity and the space complexity of these algorithms. And then it detailedly analyzes and compares those complexities which are validated by the numerical experiments on distributed memory multi computer.