Some New Designs of 2-D Array for Matrix Multiplication and Transitive Closure

  • Authors:
  • Jong-Chuang Tsay;Pen-Yuang Chang

  • Affiliations:
  • -;-

  • Venue:
  • IEEE Transactions on Parallel and Distributed Systems
  • Year:
  • 1995

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we present some new regular iterative algorithms for matrix multiplication and transitive closure. With these algorithms, by spacetime mapping the 2-D arrays with $2N - 1$ and $\lceil (3N - 1)/2\rceil$ execution times for matrix multiplication can be obtained. Meanwhile, we can derive a 2-D array with $4N - 2$ execution time for transitive closure based on the sequential Warshall-Floyd algorithm. All these new 2-D arrays for matrix multiplication and transitive closure have the advantages of faster and more regular than other previous designs.Index Terms驴Algorithm mapping, matrix multiplication, mesh array, systolic array, spherical array, transitive closure, VLSI architecture.