Self-healing in Binomial Graph Networks

The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. However, as the number of components increases, so does the probability of failure. The logical network topologies must also support the fault-tolerant capability in such dynamic environments. This paper presents a self-healing mechanism to improve the fault-tolerant capability of a Binomial graph (BMG) network. The self-healing mechanism protects BMG from network bisection and helps maintain optimal routing even in failure circumstances. The experimental results show that self-healing with an adaptive method significantly reduces the overhead from reconstructing the networks.

• Type: Conference
• Year: 2007
• Where: OTM
• Authors: Thara Angskun, George Bosilca, Jack Dongarra
• Keywords: Fault-tolerant Capability, Internet Technology, OTM 2007, Self-healing Mechanism, Self-healing Mechanism Protects