On the Analysis of Synchronous Computing Arrays,

Abstract
This paper is concerned with the analysis of synchronous, special purpose, multiple-processor systems, including, e.g., systolic arrays. There have been some results on this problem, especially by Melhem and Rheinboldt. Our approach is different, combing ideas well known in linear system theory with certain graph-theoretical concepts from computer science. A by-product of our approach to the analysis program is a rigorous characterization of the notion of equivalence between iterative algorithms.

This publication has 0 references indexed in Scilit: