Evaluation of On-Chip Static Interconnection Networks

This correspondence evaluates three types of static interconnection networks for VLSI implementation. The criteria of evaluation have been selected from three orthogonal aspects-physical (chip area and dissipation), computational speed (message delay and message density) and cost (chip yield, operational reliability and layout cost). The main feature of this paper is to augment the selection criteria for the interconnection networks from the classical AT2 metric and to provide results pertaining to realistic VLSI implementation.

[1]  M. Rem,et al.  Cost and performance of VLSI computing structures , 1979, IEEE Transactions on Electron Devices.

[2]  Howard Jay Siegel,et al.  Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Address Masks , 1977, IEEE Transactions on Computers.

[3]  C.H. Sequin.  Managing VLSI complexity: An outlook , 1983, Proceedings of the IEEE.

[4]  E. Douglas Jensen,et al.  Computer Interconnection Structures: Taxonomy, Characteristics, and Examples , 1975, CSUR.

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

[6]  Mikhail Jibrayil Atallah.  Algorithms for vlsi networks of processors , 1983 .

[7]  R. E. Anderson,et al.  The H Diagram: A Graphical Approach to Logic Design , 1971, IEEE Transactions on Computers.

[8]  J. Savage.  Planar Circuit Complexity and The Performance of VLSI Algorithms , 1981 .

[9]  Franco P. Preparata,et al.  The cube-connected-cycles: A versatile network for parallel computation , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[10]  Howard Jay Siegel,et al.  A Model of SIMD Machines and a Comparison of Various Interconnection Networks , 1979, IEEE Transactions on Computers.

[11]  Kenneth J. Thurber,et al.  Interconnection networks: a survey and assessment , 1974, AFIPS '74.

[12]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[13]  Kai Hwang,et al.  Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.

[14]  Frank Thomson Leighton.  A layout strategy for VLSI which is provably good (Extended Abstract) , 1982, STOC '82.

[15]  Ellis Horowitz,et al.  The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSI , 1981, IEEE Transactions on Computers.

[16]  C. Y. Lee.  An Algorithm for Path Connections and Its Applications , 1961, IRE Trans. Electron. Comput..

[17]  Hideo Fujiwara,et al.  A New Built-In Self-Test Design for PLA's with Hligh Fault Coverage and Low Overhead , 1987, IEEE Transactions on Computers.

[18]  David F Barbe,et al.  Very Large Scale Integration (VLSI) Fundamentals and Applications , 1980 .

[19]  S. N. Maheshwari,et al.  Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees , 1983, IEEE Transactions on Computers.

[20]  Larry D. Wittie,et al.  Communication Structures for Large Networks of Microcomputers , 1981, IEEE Transactions on Computers.

[21]  Tse-yun Feng,et al.  A Survey of Interconnection Networks , 1981, Computer.

[22]  Charles H. Stapper,et al.  Modeling of Integrated Circuit Defect Sensitivities , 1983, IBM J. Res. Dev..