Author： Piano Cristiana
Publisher： Taylor & Francis Ltd
ISSN： 1063-7192
Source： Parallel Algorithms and Applications, Vol.18, Iss.1-2, 2003-03, pp. : 71-89
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
In this paper we discuss the case in which, using the generalized Cannon's algorithm, it is possible to reduce communications in matrix multiplication. We then apply reduction of communications to the case in which we have to multiply large matrices, in particular rectangular matrices. Two strategies are proposed to solve the problem of multiplying two large squared matrices. For the case in which we have to deal with small matrices, some methods are proposed to use the entire number of processors.
Related content
大型矩阵相乘并行计算的特性分析 Performance Analysis of Large Scale Parallel Matrix Multiplication
Software Engineering and Applications, Vol. 02, Iss. 01, 2013-02 ,pp. :
Access to resources
Recommend
Access to resources
Fast Inclusion of Interval Matrix Multiplication
By Ogita Takeshi Oishi Shin’ichi
Reliable Computing, Vol. 11, Iss. 3, 2005-06 ,pp. :