A Software Based Approach for Providing Network Fault Tolerance in Clusters with uDAPL interface: MPI Level Design and Performance Evaluation

2006 ◽  
Author(s):  
Abhinav Vishnu ◽  
Prachi Gupta ◽  
Amith Mamidala ◽  
Dhabaleswar Panda
Keyword(s):  
Performance Evaluation ◽  
Fault Tolerance ◽  
Level Design ◽  
And Performance ◽  
Network Fault Tolerance ◽  
Network Fault

scholarly journals Conditional Disconnection Probability in Star Graphs

VLSI Design ◽  
1993 ◽  
Vol 1 (1) ◽  
pp. 61-70
Author(s):  
Walid Najjar ◽  
Pradip K. Srimani
Keyword(s):  
Monte Carlo Simulation ◽  
Monte Carlo ◽  
Fault Tolerance ◽  
Vlsi Design ◽  
Analytical Approximation ◽  
Network Resilience ◽  
Probabilistic Measure ◽  
Star Graphs ◽  
Network Fault Tolerance ◽  
Network Fault

Recently a new interconnection topology has been proposed which compares very favorably with the well known n-cubes (hypercubes) in terms of degree, diameter, fault-tolerance and applicability in VLSI design. In this paper we use a new probabilistic measure of network fault tolerance expressed as the probability of disconnection to study the robustness of star graphs. We derive analytical approximation for the disconnection probability of star graphs and verify it with Monte Carlo simulation. We then compare the results with hypercubes [4]. We also use the measures of network resilience and relative network resilience to evaluate the effects of the disconnection probability on the reliability of star graphs.

scholarly journals Hypercube Network Fault Tolerance: A Probabilistic Approach

2005 ◽  
Vol 06 (01) ◽  
pp. 17-34 ◽  
Author(s):  
JIANER CHEN ◽  
IYAD A. KANJ ◽  
GUOJUN WANG
Keyword(s):  
Fault Tolerance ◽  
Lower Bounds ◽  
Network Connectivity ◽  
Point Of View ◽  
Theoretical Point ◽  
Node Failure ◽  
Hypercube Network ◽  
Network Fault Tolerance ◽  
Hypercube Networks ◽  
Network Fault

Extensive experiments and experience have shown that the well-known hypercube networks are highly fault tolerant. What is frustrating is that it seems very difficult to properly formulate and formally prove this important fact, despite extensive research efforts in the past two decades. Most proposed fault tolerance models for hypercube networks are only able to characterize very rare extreme situations thus significantly underestimating the fault tolerance power of hypercube networks, while for more realistic fault tolerance models, the analysis becomes much more complicated. In this paper, we develop new techniques that enable us to analyze a more realistic fault tolerance model and derive lower bounds for the probability of hypercube network fault tolerance in terms of node failure probability. Our results are both theoretically significant and practically important. From the theoretical point of view, our method offers very general and powerful techniques for formally proving lower bounds on the probability of network connectivity, while from the practical point of view, our results provide formally proven and precisely given upper bounds on node failure probabilities for manufacturers to achieve a desired probability for network connectivity. Our techniques are also useful and powerful for analysis of the performance of routing algorithms, and applicable to the study of other hierarchical network structures and to other network communication problems.

scholarly journals Network Fault Tolerance in LA-MPI

2003 ◽  
pp. 344-351 ◽  
Author(s):  
Rob T. Aulwes ◽  
David J. Daniel ◽  
Nehal N. Desai ◽  
Richard L. Graham ◽  
L. Dean Risinger ◽  
...  
Keyword(s):  
Fault Tolerance ◽  
Network Fault Tolerance ◽  
Network Fault
Sign in / Sign up

Export Citation Format

Share Document