Recursive Folding For Thel Efficiency Improvement Of Systolic Arrays - Part Ilj

Abstract

In this paper, the general theory of Recursive Folding developed in [1] is extended to the description of transformation of diagonal links. This type of link is present, for ixample, in the 2D hex systolic array for matrix-matrix multiplication [3]. By using the results derived in [1] and in this paper, the number of processors in the 2D-hex systolic array is reduced by about 33% as compared with [2], and the time complexity is the same.

Keywords:

• Recursive folding
• systolic array
• matrix multiplication

C.R. Categories::

• C 1.2
• F 1.1

^∗Institute for Informatics,Slovak Academy of Science,Bratislava and Nuclear Power Plant Research Institute, Trnava, Slovakia.

^† Funded by Royal Society Foreigen Fellowship Scheme.

^∗Institute for Informatics,Slovak Academy of Science,Bratislava and Nuclear Power Plant Research Institute, Trnava, Slovakia.

^† Funded by Royal Society Foreigen Fellowship Scheme.

Notes

^∗Institute for Informatics,Slovak Academy of Science,Bratislava and Nuclear Power Plant Research Institute, Trnava, Slovakia.

^† Funded by Royal Society Foreigen Fellowship Scheme.

Additional information

Notes on contributors

G. Okša

∗ †