The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors

This paper describes by a series of examples a strategy for designing testable fault-tolerant arrays of processors. The strategy achieves fault tolerance by introducing redundancy in an array's communication links rather than in its processing elements (PE's). The major characteristics of the designs produced are as follows.

[1]  Thomas Ottmann,et al.  The Power of a One-Dimensional Vector of Processors , 1980, WG.

[2]  H. T. Kung,et al.  The Design of Special-Purpose VLSI Chips , 1980, Computer.

[3]  Donald S. Fussell,et al.  Fault-tolerant wafer-scale architectures for VLSI , 1982, ISCA 1982.

[4]  J. Greene,et al.  Area and Delay Penalties in Restructurable Wafer-Scale Arrays , 1983 .

[5]  H. T. Kung,et al.  On the Area of Binary Tree Layouts , 1980, Inf. Process. Lett..

[6]  Melvin A. Breuer,et al.  On Area and Yield Considerations for Fault-Tolerant VLSI Processor Arrays , 1984, IEEE Transactions on Computers.

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

[8]  Bernard Chazelle,et al.  Census functions: An approach to VLSI upper bounds , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[9]  Chak-Kuen Wong,et al.  Minimum K-hamiltonian graphs , 1984, J. Graph Theory.

[10]  H. T. Kung,et al.  Two papers on a tree-structured parallel computer , 1979 .

[11]  Charles E. Leiserson,et al.  How to assemble tree machines (Extended Abstract) , 1982, STOC '82.

[12]  Arnold L. Rosenberg,et al.  A Dictionary Machine (for VLSI) , 1982, IEEE Transactions on Computers.

[13]  Charles E. Leiserson,et al.  Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[14]  Frank Thomson Leighton,et al.  Wafer-scale integration of systolic arrays , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[15]  Arnold L. Rosenberg,et al.  On Embedding Rectangular Grids in Square Grids , 1982, IEEE Transactions on Computers.

[16]  Charles E. Leiserson,et al.  How to assemble tree machines , 1984 .

[17]  R.C. Aubusson,et al.  Wafer-scale integration-a fault-tolerant procedure , 1978, IEEE Journal of Solid-State Circuits.

[18]  Leslie G. Valiant,et al.  Universality considerations in VLSI circuits , 1981, IEEE Transactions on Computers.

[19]  Charles E. Leiserson.  Systolic Priority Queues , 1979 .

[20]  P. Erdoes,et al.  On sparse graphs with dense long paths. , 1975 .

[21]  Israel Koren.  A reconfigurable and fault-tolerant VLSI multiprocessor array , 1981, ISCA '81.

[22]  Israel Koren,et al.  Embedding Tree Structures in VLSI Hexagonal Arrays , 1984, IEEE Transactions on Computers.

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

[24]  Frank B. Manning,et al.  An Approach to Highly Integrated, Computer-Maintained Cellular Arrays , 1977, IEEE Transactions on Computers.

[25]  Charles E. Leiserson,et al.  Area-Efficient VLSI Computation , 1983 .