Reconfiguration Strategies for VLSI Processor Arrays and Trees Using a Modified Diogenes Approach

The authors deal with reconfiguration of a rectangular array of processors arranged as an N*N mesh, and a complete binary tree of N processors. They present new reconfiguration techniques that are modifications of the Diogenes approach proposed earlier by A.L. Rosenberg et al. (1983). These techniques reduce the overheads incurred in the earlier Diogenes schemes. Some of the previous approaches to the problem are summarized. Two schemes are presented for reconfiguring rectangular arrays and a scheme for reconfiguring trees. For the analysis of the different schemes presented, it is assumed that a processor has a square layout. These schemes are analyzed and their performance results are presented. >

[1]  Vinod K. Agarwal,et al.  A Fault-Tolerant Modular Architecture for Binary Trees , 1986, IEEE Transactions on Computers.

[2]  Mariagiovanna Sami,et al.  Fault Tolerance Techniques for Array Structures Used in Supercomputing , 1986, Computer.

[3]  Kye Sherrick Hedlund.  Wafer scale integration of configurable, highly parallel processors , 1982 .

[4]  Arnold L. Rosenberg,et al.  The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors , 1983, IEEE Transactions on Computers.

[5]  Adriano Valenzano,et al.  DEFECT-TOLERANT ARRAY STRUCTURES FOR VLSI AND WSI ARCHITECTURES , 1987 .

[6]  Jeffrey D Ullma.  Computational Aspects of VLSI , 1984 .

[7]  Prithviraj Banerjee,et al.  Reconfiguration strategies in VLSI processor arrays , 1988, Proceedings 1988 IEEE International Conference on Computer Design: VLSI.

[8]  W. Kent Fuchs,et al.  Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance , 1987, IEEE Transactions on Computers.

[9]  Frank Thomson Leighton,et al.  Wafer-Scale Integration of Systolic Arrays , 1985, IEEE Trans. Computers.

[10]  Renato Stefanelli,et al.  Reconfigurable architectures for VLSI processing arrays , 1986 .

[11]  John P. Hayes,et al.  A Graph Model for Fault-Tolerant Computing Systems , 1976, IEEE Transactions on Computers.

[12]  Arnold L. Rosenberg,et al.  Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .

[13]  Arnold L. Rosenberg,et al.  Vertex Types in Book-Embeddings , 1987, SIAM J. Discret. Math..

[14]  Chu-Sing Yang,et al.  A reconfigurable modular fault-tolerant binary tree architecture , 1993, Proceedings of Phoenix Conference on Computers and Communications.

[15]  W.R. Moore,et al.  A review of fault-tolerant techniques for the enhancement of integrated circuit yield , 1986, Proceedings of the IEEE.

[16]  Milos D. Ercegovac,et al.  Fault Tolerance in Binary Tree Architectures , 1984, IEEE Transactions on Computers.

[17]  Kenneth E. Batcher,et al.  Design of a Massively Parallel Processor , 1980, IEEE Transactions on Computers.

[18]  Lawrence Snyder,et al.  Introduction to the configurable, highly parallel computer , 1982, Computer.