Designing modular linear systolic arrays using dependence graph regular partitions

Abstract

In this paper, we use a variant of the geometric method to derive efficient modular linear systolic algorithms for the transitive closure and shortest path problems. Furthermore, we show that partially-pipelined modular linear systolic algorithms with an output operation, for matrix multiplication, can be as efficient as fully-pipelined ones, and in some cases needs less cells.