Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance
IEEE Transactions on Computers
Designing fault-tolerant systems using automorphisms
Journal of Parallel and Distributed Computing
Advances in Computer Architecture
Advances in Computer Architecture
Fault Tolerance: Principles and Practice
Fault Tolerance: Principles and Practice
Fault-tolerance and reconfiguration of circulant graphs and hypercubes
Proceedings of the 2008 Spring simulation multiconference
Applying fault-tolerant solutions of circulant graphs to multidimensional meshes
Computers & Mathematics with Applications
Developing fault-tolerant distributed loops
Information Processing Letters
| Hi-index | 0.00 |
We develop a characterization for m-fault-tolerant extensions, and for optimalm-fault-tolerant extensions, of a complete multipartite graph. Our formulation shows thatthis problem is equivalent to an interesting combinatorial problem on the partitioning ofintegers. This characterization leads to a new procedure for constructing an optimalm-fault-tolerant extension of any complete multipartite graph, for any m/spl ges/0. Theproposed procedure is mainly useful when the size of the graph is relatively small,because the search time required is exponential. This exponential search, however, is notalways necessary. We prove several necessary conditions that help us, in several cases,to identify some optimal m-fault-tolerant extensions without performing any search.