Paper
16 December 1989 Arrays For Partitioned Matrix Algorithms: Tradeoffs Between Cell Storage And Cell Bandwidth
Jaime H. Moreno, Tomas Lang
Author Affiliations +
Abstract
A graph-based partitioning method for designing systolic arrays for matrix computations is extended to apply it to processing elements with a small local memory. The introduction of this memory produces a reduction in the cell communication bandwidth and facilitates the use of pipelining within cells. As a consequence, efficient arrays can be designed using the extended method combined with technological parameters that define the ratio between processor speed and communication bandwidth. The extended partitioning method also allows evaluating tradeoffs between linear and two-dimensional arrays. We illustrate the method using a cube-shaped canonical algorithm, which is communication and computation intensive, and triangularization by Givens' rotations.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jaime H. Moreno and Tomas Lang "Arrays For Partitioned Matrix Algorithms: Tradeoffs Between Cell Storage And Cell Bandwidth", Proc. SPIE 0977, Real-Time Signal Processing XI, (16 December 1989); https://doi.org/10.1117/12.948567
Lens.org Logo
CITATIONS
Cited by 7 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Data communications

Prisms

Signal processing

Data storage

Feedback loops

Binary data

Array processing

RELATED CONTENT

Progress On A Systolic Processor Implementation
Proceedings of SPIE (December 28 1982)
On-Line Arithmetic: An Overview
Proceedings of SPIE (November 28 1984)
A tree index routing structure in a peer to peer...
Proceedings of SPIE (September 10 2007)
Concurrent Viterbi Algorithm With Trace-Back
Proceedings of SPIE (April 04 1986)

Back to Top