If you want to remain in the traditional methods (complexity n^3), what you need is a GEMM (generalized matrix multiplication), and it is provided in C, for dense matrices, by ScaLAPACK. The implementation provided on your blog is indeed a rough cut, there are better solutions (matrices divided in blocks k-cyclic) proposed by the SUMMA and PUMMA algorithms.
George. On Wed, Oct 28, 2015 at 9:14 AM, Ibrahim Ikhlawi <ibrahim_...@hotmail.com> wrote: > Hi, > > what is the best way to multiply two matrices with java-openmpi. > Is the way in this link the right way to do that? Also split the first > matrix row wise and multiply each one with the second matrix (each row on a > processor) then collect the results. > > Link: > https://anjanavk.wordpress.com/2011/01/08/matrix-multiplication-in-parallel-using-open-mpi/ > > regards > Ibrahim > > _______________________________________________ > users mailing list > us...@open-mpi.org > Subscription: http://www.open-mpi.org/mailman/listinfo.cgi/users > Link to this post: > http://www.open-mpi.org/community/lists/users/2015/10/27930.php >
