Cart (Loading....) | Create Account
Close category search window

Complexity of Matrix Product on a Class of Orthogonally Connected Systolic Arrays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Melkemi, L. ; Laboratoire TIM3 ; Tchuente, M.

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 move vertically, whereas aik and bkj move horizontally in opposite directions. We first introduce a combinatorial formulation of the problem. Then we show that, if the cycle-time of a multiply-add cell is taken as time unit, and if T(p, m) denotes the running time of an optimal algorithm associated with an array of size p x m, then Minpm T(p,m) = 3n -2, and the minimum value of p.m for which this bound is tight is n.n [resp. n(n + 1)] if n is odd (resp. even). When compared to the algorithms previously proposed for the class of arrays based on cells without local memory, the solutions exhibited here appear to be the best, because they are the only ones which run in time T < = 3n -2 on a network of size S < = n(n + 1).

Published in:

Computers, IEEE Transactions on  (Volume:C-36 ,  Issue: 5 )

Date of Publication:

May 1987

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.