Systematic design of systolic arrays using mapping algorithm

Horiike, S.; Nishida, Shogo; Sakaguchi, Toshiaki

doi:10.1109/iscas.1988.15451

Cited by 2 publications

(1 citation statement)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Usually for this class of problems, operators used in their algorithm satisfy the associative and commutative properties. Typical examples in this class are matrix multiplication Manuscript received April 28, 1989; revised November 11,1990 , [4], (51, [7]- [9]. We study some combinatorial characteristics of the graph and extract their essential information, then formalize it on two tables-the tzminglevel table and the processor assignment table.…”

Section: Introductionmentioning

confidence: 99%

Some combinatorial aspects of parallel algorithm design for matrix multiplication

Tsay

Yuan²

1992

IEEE Trans. Comput.

View full text Add to dashboard Cite

In this paper, some combinatorial characteristics of matrix multiplication on regular two-dimensional arrays are studied. From the studies, we 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, we find that there is a transformation procedure to transform a cylindrical array to a two-layered mesh array.

show abstract

Section: Introductionmentioning

confidence: 99%