Efficient fault-tolerant mesh and hypercube architectures

FTCS 1992 - 22nd Annual International Symposium on Fault-Tolerant Computing

Volumn , Issue , 1992, Pages 162-169

  Bruck, J ^a   Cypher, R ^a   Ho, C T ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARCHITECTURE; FAULT TOLERANCE; MESH GENERATION;

D-DIMENSIONAL MESH; FAULT TOLERANT MESHES; FAULT-TOLERANT; FAULT-TOLERANT ARCHITECTURES; HYPERCUBE; MAXIMUM DEGREE; MINIMIZING THE NUMBER OF;

COMPUTER ARCHITECTURE;

EID: 33747827348     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FTCS.1992.243604     Document Type: Conference Paper

References (20)

1. F. Annexstein, Fault Tolerance in HypercubeDerivative Networks, Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 179-188, 1989.
2. V. Balasubramanian and P. Banerjee, A Fault Tolerant Massively Parallel Processing Architecture, J. of Parallel and Distributed Computing, vol. 4, pp. 363-383, 1987.
3. K. E. Batcher, Design of a Massively Parallel Processor, IEEE Trans. on Computers, val. C-29, no. 9, pp. 836-840, September 1980.
4. J. Bruck, R. Cypher and C.-T. Ho, Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares, IBM Research Report, RJ 8211, July 1991.
5. J. Bruck, R. Cypher and D. Soroker, Running Algorithms Efficiently on Faulty Hypercubes, Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 37-44, 1990.
6. S. Dutt and J. P. Hayes, On Designing and Reconfiguring k-Fault-Tolerant Tree Architectures, IEEE Trans. on Computers, val. C-39, no. 4, pp. 490-503, April 1990.
7. S. Dutt and J. P. Hayes, Designing Fault-Tolerant Systems Using Automorphisms, Journal of Parallel and Distributed Computing, vol. 12, pp. 249-268, 1991.
8. S. Dutt and J. P. Hayes, Some Practical Issues in the Design of Fault-Tolerant Multiprocessors, Proceedings of the 21st International Symposium on Fault-Tolerant Computing, pp. 292-299, June 1991.
9. B. Elspas and J. Turner, Graphs with Circulant Adjacency Matrices, J. of Combinatorial Theory, no. 9, pp. 297-307, 1970.
10. J. Hastad, F. T. Leighton and M. Newman, Fast Computations using Faulty Hypercubes, Proceedings of 21st Annual ACM Symposium on Theory of Computing, pp. 251-284, 1989.
11. J. P. Hayes, A Graph Mode/for Fault-Tolerant Computing Systems, IEEE Trans. on Computers, val. C-25, no. 9, pp. 875-884, September 1976.
12. C. Kaklamanis, A. R. Karlin, F. T. Leighton, V. Milenkovic, P. Raghavan, S. Rao, C. Thomborson and A. Tsantilas, Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors, Proc. of 31st Annual IEEE Symp. on Foundations of Computer Science, pp. 285-296, October 1990.
13. S.-Y. Kuo and W. K. Fuchs, Efficient Spare Allocation for Reconfigurable Arrays, IEEE Design and Test, pp. 24-31, February 1987.
14. F. T. Leighton and C. E. Leiserson, Wafer Scale Integration of Systolic Arrays, IEEE Trans. on Computers, val. C-34, no. 5, pp. 448-461, May 1985.
15. A. J. Martin, The Torus: An Exercise in Constructing a Processing Surface, Proc. 2nd Caltech Conf. on VLSI, pp. 527-537, Jan. 1981.
16. M. Paoli, W. W. Wong and C. K. Wong, Minimum k-Hamiltonian Graphs, II, J. of Graph Theory, Vol. 10, pp. 79-95, 1986.
17. A. L. Rosenberg, The Diogenes Approach to Testable Fault-Tolerant VLSI Processor Arrays, IEEE Trans. on Computers, Vol. C-32, no. 10, pp. 902-910, October 1983.
18. V. P. Roychowdhury, J. Bruck and T. Kailath, Efficient Algorithms for Reconfiguration in VLSI/WSI Arrays, IEEE Trans. on Computers, vol. C-39, no. 4, pp. 480-489, April 1990.
19. Y. Ueoka, C. Minagawa, M. Oka and A. Ishimoto. A Defect-Tolerant Design for Full-Wafer Memory LSI, IEEE Journal of Solid-State Circuits, vol. SC-19, no. 3, June 1984.
20. W. W. Wong and C. K. Wong, Minimum kHamiltonian Graphs, J. of Graph Theory, Vol. 8, pp. 155-165, 1984.