Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Fast computation using faulty hypercubes
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Construction of the mesh and the torus tolerating a large number of faults
Journal of Computer and System Sciences
Fault-Tolerant Meshes with Small Degree
SIAM Journal on Computing
Efficient Self-Embedding of Butterfly Networks with Random Faults
SIAM Journal on Computing
Fault tolerant data structures
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Optimal fault-tolerant linear arrays
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Immunet: A Cheap and Robust Fault-Tolerant Packet Routing Mechanism
Proceedings of the 31st annual international symposium on Computer architecture
Fault Tolerant Asynchronous Adder through Dynamic Self-reconfiguration
ICCD '05 Proceedings of the 2005 International Conference on Computer Design
Hierarchical topological network design
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
In this paper, we study the design of fault tolerant networks for arrays and meshes by adding redundant nodes and edges. For a target graph G (linear array or mesh in this paper), a graph G′ is called a &kgr;-fault-tolerant graph of G if when we remove any &kgr; nodes from G′, it still contains a subgraph isomorphic to G. The major quality measures for a fault-tolerant graph are the number of spare nodes it uses and the maximum degree it has. The degree is particularly important in practice as it poses constraints on the scalability of the system. In this paper, we aim at designing fault-tolerant graphs with both small degree and small number of spare nodes. The graphs we obtain have degree O(1) for arrays and O(log3 &kgr;) for meshes. The number of spare nodes used are O(&kgr; log2 &kgr;) and O(&kgr;2/log &kgr;), respectively. Compared to the previous results, the number of spare nodes used in our construction has one fewer linear factor in &kgr;.