论文信息 - On the Analysis of Synchronous Computing Arrays

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.

[1] Charles E. Leiserson,et al. Optimizing synchronous systems , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[2] Shimon Even,et al. Graph Algorithms , 1979 .

[3] Hanoch Lev-Ari. Modular Computing Networks: A New Methodology for Analysis and Design of Parallel Algorithms/Architectures, , 1983 .

[4] Ronald A Rohrer,et al. Circuit Theory an introduction to the State Variable Approach , 1969 .

[5] Hartmut Schmeck,et al. Systolic Sorting on a Mesh-Connected Network , 1985, IEEE Transactions on Computers.

[6] H. Kung,et al. An algebra for VLSI algorithm design , 1983 .

[7] G. Dantzig. On the Shortest Route Through a Network , 1960 .

[8] Carver A. Mead,et al. Concurrent Algorithms as Space-Time Recursion Equations , 1983 .

[9] H. T. Kung. Why systolic architectures? , 1982, Computer.

[10] H. T. Kung,et al. Systolic Arrays for (VLSI). , 1978 .

[11] H. T. Kung. Let's Design Algorithms for VLSI Systems , 1979 .

[12] Lynn Conway,et al. Introduction to VLSI systems , 1978 .