Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm

From MaRDI portal
Publication:4489982





Computational broadcast elimination is defined in terms of the system of affine recurrence equations. It is shown that it can be eliminated by introducing a new recurrence equation in the single assignment code. Several examples are given to demonstrate the proposed procedure. The QR decomposition algorithm, where computational broadcast occurs for two variables, is localized and implemented on a processor array by using the data dependence method. It is shown that, in some cases, the algorithm can be realized by using only half the processors at the cost of doubling the complexity of processors used.











This page was built for publication: Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489982)