Topological Properties of Hypercubes
IEEE Transactions on Computers
Designing fault-tolerant systems using automorphisms
Journal of Parallel and Distributed Computing
Tolerating faulty edges in a multi-dimensional mesh
Parallel Computing
Multiple-Edge-Fault Tolerance with Respect to Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Meshes with Small Degree
SIAM Journal on Computing
Fault-Tolerant Meshes with Small Degree
IEEE Transactions on Computers
Fault Tolerance: Principles and Practice
Fault Tolerance: Principles and Practice
Optimal 1-edge fault-tolerant designs for ladders
Information Processing Letters
Modular Fault-Tolerant Boolean N-Cubes
IEEE Micro
Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares
IEEE Transactions on Computers
The Fault-Tolerant Extension Problem for Complete Multipartite Networks
IEEE Transactions on Parallel and Distributed Systems
Algorithm for constructing fault-tolerant solutions of the circulant graph configuration
FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Designing and Reconfiguring Fault-Tolerant Hypercubes
HPCS '06 Proceedings of the 20th International Symposium on High-Performance Computing in an Advanced Collaborative Environment
The Basic Fault-tolerant System
IEEE Micro
Applying fault-tolerant solutions of circulant graphs to multidimensional meshes
Computers & Mathematics with Applications
Developing fault-tolerant distributed loops
Information Processing Letters
Extending a distributed loop network to tolerate node failures
Proceedings of the Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging
Fault-tolerant circulant digraphs networks
Proceedings of the 2013 Research in Adaptive and Convergent Systems
| Hi-index | 0.00 |
Several interconnection networks (such as rings, meshes and hypercubes) can be modeled as circulant graphs. As a result, methods previously developed for constructing fault-tolerant solutions of circulant graphs can also be applied to these networks. Among these methods, the one based on the idea of "offsets partitioning" is the most efficient (for circulant graphs). We review this method in this paper, and extend its applications to hypercubes. Moreover, we develop new algorithms to reconfigure circulant graphs and hypercubes. Our results show that the fault-tolerant solutions obtained, and the reconfiguration algorithms developed are efficient.