This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Complexity of Matrix Product on a Class of Orthogonally Connected Systolic Arrays
May 1987 (vol. 36 no. 5)
pp. 615-619
L. Melkemi, Laboratoire TIM3
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
Usage of this product signifies your acceptance of the Terms of Use.