Paper
23 March 1986 Systolic Partitioned And Banded Linear Algebraic Computations
J. Greg Nash, Siegfried Hansen, K. Wojtek Przytula
Author Affiliations +
Abstract
For general linear algebraic computations in science, engineering and mathematics, problem sizes typically grow until constraints imposed by computation rates, I/O or memory availability result in unreasonably long execution times. From this point of view such computing architectures as systolic arrays provide a potential for processing much larger arrays. However, in order to utilize this potential, the problem of how to efficiently decompose large arrays onto a fixed systolic array in a numerically stable way must be solved. In some cases this is most efficiently done by partitioning the algorithm so that it can be run as a sequence of operations on input subarrays that are of the same size as the underlying hardware array. For some cases, such as those associated with banded matrices, it is necessary only to process the non-zero data. In all cases, however, the algorithms must run on the same hardware array without an undue amount of extra control or communication overhead. In this paper we describe algorithmic and architectural approaches to providing a fairly broad range of linear algebraic operations on matrices that are much larger than the underlying hardware array. All of the techniques we describe here have been simulated in detail using APL in order to verify correctness.
© (1986) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
J. Greg Nash, Siegfried Hansen, and K. Wojtek Przytula "Systolic Partitioned And Banded Linear Algebraic Computations", Proc. SPIE 0698, Real-Time Signal Processing IX, (23 March 1986); https://doi.org/10.1117/12.976241
Lens.org Logo
CITATIONS
Cited by 6 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Matrices

Chemical elements

Signal processing

Array processing

Data processing

Diamond

Chromium

RELATED CONTENT

Modified Faddeev Algorithm For Matrix Manipulation
Proceedings of SPIE (November 28 1984)
When is QR factorization naturally rank revealing?
Proceedings of SPIE (October 02 1998)
A Review Of Signal Processing With Systolic Arrays
Proceedings of SPIE (November 28 1983)
Implementation Of An SVD Processor Using Redundant CORDIC
Proceedings of SPIE (February 23 1988)
Problem Adaptation To Systolic Arrays
Proceedings of SPIE (July 30 1982)
Alternative To The SVD: Rank Revealing QR-Factorizations
Proceedings of SPIE (April 04 1986)
Systolic Computation Of Multivariable Frequency Response
Proceedings of SPIE (April 20 1988)

Back to Top