This article is cited in 1 scientific paper (total in 1 paper)
International Conference on Environmental Mathematical Modeling and Numerical Analysis (Rostov-on-Don)
Automatic parallelization of loops with 2-dimension arrays for distributed memory supercomputers (matrix multiplication)
S. A. Lazareva, N. N. Yachmeneva
Rostov State University
The parallel performance of loops with 2-dimension arrays, particularly matrix multiplication,
is considered. The most effective algorithm of matrix multiplication for
distributed memory supercomputers that requires data dependence analyses is designed.
The method of automatic matrix distribution in a memory of each processor and
processor communications are described. The program for matrix multiplication detection
and replacing by parallel form is considered. There are some results of parallel program
performance on supercomputer nCube 2S in this paper.
PDF file (657 kB)
S. A. Lazareva, N. N. Yachmeneva, “Automatic parallelization of loops with 2-dimension arrays for distributed memory supercomputers (matrix multiplication)”, Matem. Mod., 13:2 (2001), 103–109
Citation in format AMSBIB
\by S.~A.~Lazareva, N.~N.~Yachmeneva
\paper Automatic parallelization of loops with 2-dimension arrays for distributed memory supercomputers (matrix multiplication)
\jour Matem. Mod.
Citing articles on Google Scholar:
Related articles on Google Scholar:
This publication is cited in the following articles:
Tarnavsky, GA, “Parallelization of algorithms and codes of the computational system “Potok-3””, Programming and Computer Software, 29:1 (2003), 13
|Number of views:|