An approach for increasing the flexibility of systolic arrays

Author

Barbir, A.O. ; Aravena, J.L.

Author_Institution

Dept. of Comput. Sci., Western Carolina Univ., Cullowhee, NC, USA

fYear

1990

fDate

11-13 Mar 1990

Firstpage

516

Lastpage

520

Abstract

A study is made of the operations of systolic arrays. A graph is developed to present array operation as a function of the compute cycle. A description is given of a computational procedure to determine such a graph. The graph representation is used to analyze the operation of an array and to detect special cases with reduced computational complexity. A matrix-vector multiplication array is used as a case study. Manipulation of the graph representation is used to determine sparsity patterns in the input data matrices. The resulting forms generate matrix products computable in reduced time

Keywords

computational complexity; graph theory; matrix algebra; systolic arrays; vectors; computational complexity; computational procedure; flexibility; graph; matrix-vector multiplication array; sparsity patterns; systolic arrays; Algorithm design and analysis; Computational complexity; Computer architecture; Computer science; Design methodology; Matrix decomposition; Signal processing algorithms; Systolic arrays; Timing; Transmission line matrix methods;

fLanguage

English

Publisher

ieee

Conference_Titel

System Theory, 1990., Twenty-Second Southeastern Symposium on

Conference_Location

Cookeville, TN

ISSN

0094-2898

Print_ISBN

0-8186-2038-2

Type

conf

DOI

10.1109/SSST.1990.138200

Filename

138200