Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm (Q4489982)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1472266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm |
scientific article; zbMATH DE number 1472266 |
Statements
Elimination of the computational broadcast in systolic arrays: an application to the qr decomposition algorithm (English)
0 references
11 March 2001
0 references
computational broadcast elimination
0 references
data broadcast elimination
0 references
QR decomposition algorithm
0 references
systolic arrays
0 references
affine recurrence equations
0 references
0.770956814289093
0 references
0.7652140855789185
0 references
0.7652140855789185
0 references
0.7575217485427856
0 references
0.7515478730201721
0 references
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.
0 references
