A method of performing a matrix operation in a distributed processing system having a plurality of processing nodes including a master processing node, the method comprising recursively partitioning an original matrix into matrix blocks; identifying a first set of matrix blocks and a second set of matrix blocks; processing the first set of matrix blocks on the master node to produce first set result; determining second set result for the second set of matrix blocks using the plurality of processing nodes by processing the second set of matrix blocks with the first set result; assembling the first set result and the second set result to form intermediate matrix blocks; performing the matrix operation on the intermediate matrix blocks using the plurality of processing nodes to provide an intermediate result; and determining the result of the matrix operation on the original matrix by processing the intermediate result.

A method of performing a matrix operation in a distributed processing system

This paper firstly gives a description of the traditional distribution schemes of parallel matrix multiplication and an analysis of their efficiencies. In order to reduce communication expenses between multiple processors, two solutions are offered in this paper, and the corresponding specific implementation models are also listed. Then a method of how to calculate the n-th power of massive matrix is proposed. Finally, the experimental results show that this method of calculating the n-th power of massive matrix can reduce the execution time and improve the efficiency.

Li Tao

Papers

Study on parallel processing method of matrix multiplication--A method to calculate the N-th power of massive matrix