Designing fault-tolerant systems using automorphisms

Journal of Parallel and Distributed Computing

Volumn 12, Issue 3, 1991, Pages 249-268

  Dutt, Shantanu ^a   Hayes, John P ^b  

^a UNIVERSITY OF MINNESOTA   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; MATHEMATICAL TECHNIQUES--GRAPH THEORY;

AUTOMORPHISM; CIRCULANT GRAPHS; FAULT-TOLERANT MULTIPROCESSORS; HYPERCUBE MULTIPROCESSORS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0026188277     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-7315(91)90129-W     Document Type: Article

References (29)

1. On the abstract group of automorphisms
2. Reconfigurable cube-connected cycles architecture
3. A framework for solving graph layout problems
4. Algebraic Methods in Graph Theory
5. Circulants and their connectivities
6. Diogenes: A methodology for designing fault-tolerant VLSI processor arrays
7. On designing and reconfiguring k-fault-tolerant tree architectures
8. Designing and reconfiguring fault-tolerant multiprocessor systems
9. Characterization of connection assignment of diagnosable systems
10. A modular approach to faulttolerant modular tree architectures
11. A graph model for fault tolerant computing systems
12. A microprocessor-based hypercube supercomputer
13. FTMP—A highly reliable fault-tolerant multiprocessor for aircraft
14. Distributed fault tolerance for large multiprocessor systems
15. An optimal 2-fault tolerant realization of symmetric hierarchical tree systems
16. Computing automorphism groups of combinatorial objects
17. Reconfiguration of VLSI arrays: A covering approach
18. Reconfigurable tree architectures using subtree oriented fault tolerance
19. On the connection assignment problem of diagnosable systems
20. Fault tolerance in binary tree architectures
21. On implementing fault-tolerance in binary hypercubes
22. The Diogenes approach to testable fault-tolerant arrays of processors
23. Topological properties of hypercubes
24. A polynomial time algorithm for fault diagnosability
25. Point-symmetric graphs with a prime number of points
26. Distributed fault recovery in multiprocessor networks