The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1987 vol.36)
pp: 615-619
L. Melkemi , Laboratoire TIM3
ABSTRACT
This correspondence studies the time complexity of the parallel computation of the product C = A.B of two dense square matrices A, B of order n, on a class of rectangular orthogonally connected systolic arrays, which are the two-dimensional extensions of the classical pipeline scheme. Such arrays are composed of multiply-add cells without local memory, and, as C is computed, the coefficients cij m
INDEX TERMS
time-complexity, Combinatorial formulation, matrix multiplication, multiply-add cell, optimal algorithm, parallel computation, systolic array
CITATION
L. Melkemi, M. Tchuente, "Complexity of Matrix Product on a Class of Orthogonally Connected Systolic Arrays", IEEE Transactions on Computers, vol.36, no. 5, pp. 615-619, May 1987, doi:10.1109/TC.1987.1676946
43 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool