Sciweavers

Share
ISPA
2007
Springer

Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology

11 years 7 months ago
Binomial Graph: A Scalable and Fault-Tolerant Logical Network Topology
The number of processors embedded in high performance computing platforms is growing daily to solve larger and more complex problems. The logical network topologies must also support the high degree of scalability in dynamic environments. This paper presents a scalable and fault tolerant topology called binomial graph (BMG). BMG provides desirable topological properties in terms of both scalability and fault-tolerance for high performance computing such as reasonable degree, regular graph, low diameter, symmetric graph, low cost factor, low message traffic density, optimal connectivity, low fault-diameter and strongly resilient. Several fault-tolerant routing algorithms are provided on BMG for various message types. More importantly, BMG is able to deliver broadcast messages from any node within log2(n) steps.
Thara Angskun, George Bosilca, Jack Dongarra
Added 08 Jun 2010
Updated 08 Jun 2010
Type Conference
Year 2007
Where ISPA
Authors Thara Angskun, George Bosilca, Jack Dongarra
Comments (0)
books