多处理机中矩阵乘法的算法研究

从矩阵乘法的顺序代码、并行代码中分析了其通信时间开销和计算性时间复杂性,提出了使用直接法、子矩阵和递归算法;为提高效率,还提出了将通信安排在计算过程中间进行的算法,使得计算获得最大的重合。解决了多处理机系统中因处理器间的通信速度相对滞后所产生的负面影响问题,给数值计算带来很大的方便。

Matrix multiplication's algorithm research In multiprocessing machine

This artile analyses the communicating time expense and the computation time complexity from the smooth code and the parallel code in the matrix multiplication. It proposes the use of direct method, the sub- matrix and the recursion algorithm. In order to enhance the efficiency, it also proposes the algorithm which arranges the communitcation among the computation process and causes the computation to obtain the biggest superposition. It has solved the problem of the negative influence problem resulting from communicating speed's relative lag in the multi-processor system and brought the very big convenience for the value computation.