Issue No. 03 - March (1992 vol. 41)

ISSN: 0018-9340

pp: 355-361

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.127449

ABSTRACT

<p>Some combinatorial characteristics of matrix multiplication on regular two-dimensional arrays are studied. From the studies, the authors are able to design many efficient varieties of the cylindrical array and the two-layered mesh array for matrix multiplication. To design a cylindrical array for matrix multiplication, a systematic design procedure is proposed. In this design procedure, Latin square (a special type of matrix) plays an important role. To design a two-layered mesh array, it is found that there is a transformation procedure to transform a cylindrical array to a two-layered mesh array.</p>

INDEX TERMS

combinatorial aspects; parallel algorithm; matrix multiplication; two-dimensional arrays; cylindrical array; two-layered mesh array; Latin square; two-layered mesh array; transformation procedure; combinatorial mathematics; matrix algebra; parallel algorithms.

CITATION

S. Yuan and J. Tsay, "Some Combinatorial Aspects of Parallel Algorithm Design for Matrix Multiplication," in

*IEEE Transactions on Computers*, vol. 41, no. , pp. 355-361, 1992.

doi:10.1109/12.127449

CITATIONS