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
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
The Basic Fault-tolerant System
IEEE Micro
Fault-tolerance and reconfiguration of circulant graphs and hypercubes
Proceedings of the 2008 Spring simulation multiconference
On the chromatic number of integral circulant graphs
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.09 |
Recently, circulant graphs have received a lot of attention; and a new method was proposed for designing fault-tolerant solutions for any given circulant graph. This method works by partitioning the offsets of the graph in many ways; each leads to one or more solutions. By comparing all these solutions, we can find the one with the least node-degree. In this paper, we shall first review this method; and then re-examine its applications to the design of k-fault-tolerant meshes (for all possible values of k). Our results demonstrate that the solutions obtained (for both two and three-dimensional meshes) are efficient.