Folding and unrolling systolic arrays (Preliminary Version)

  • Authors:
  • K. Culik, II;Jan K. Pachl

  • Affiliations:
  • -;-

  • Venue:
  • PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
  • Year:
  • 1982

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper is about two constructions for transforming planar systolic arrays. By a systolic array we mean a uniformly structured processor configuration that allows only local communication (between neighbour processors) and supports high throughout by pipelining. Such configurations are suitable for VLSI implementation [4, 5]. We show how new connections in a systolic array can be established by folding the array along a line; and how computations in one-dimensional arrays unroll to two-dimensional structures resembling trellis automata [2]. We construct systolic arrays for computing large powers of a matrix; for matching keywords; for recognizing square-free words; and for finding the controlled product of matrices.