Solving matrix problems with no size restriction on a systolic array processor
Document typeResearch report
Rights accessOpen Access
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder
In this paper we propose several data structures partitioning and transformation schemes, in order to get an efficient execution of various matrix algorithms without any size resriction. The following matrix operations are considered: -Matrix-Matrix multiplication -Solving triangular matrix equations -L-U decomposition -Inverses of triangular and dense matrices All these algorithms are to be executed on a problem-size independent sprial systolic array processor. The array topology is fixed, and a simple feedback and control are needed. For all the algorithms that have been considered, the PE's utilization tends to the maximum possible value.
This work was supported by Ministery of Education of Spain (CAICYT) under Grant Number 2906-83 C03-03
CitationNavarro, J., Llaberia, J., Valero, M. "Solving matrix problems with no size restriction on a systolic array processor". 1986.
Is part ofRR 86/01