Spacetime-minimal systolic arrays for Gaussian elimination and the Algebraic path problem

Abstract

In this paper, we derive time-minimal systolic arrays for Gaussian elimination and the Algebraic Path Problem (APP) that use a minimal number of processors. For a problem of size n, we obtain an execution time T( n) = 3 n −1 using A( n) = n 2/4+O( n) processors for Gaussian elimination, and T( n) = 5 n −2 and A( n) = n 3/+O( n) for the APP.