scholarly journals Analysis of Trade-offs in Fault-Tolerant Distributed Computing and Replicated Databases

2020 ◽  
Author(s):  
Anatoliy Gorbenko ◽  
Andrii Karpenko ◽  
Olga Tarasyuk
Keyword(s):  
Distributed Computing ◽  
Fault Tolerant ◽  
Replicated Databases ◽  
Trade Offs

The Optimal Checkpoint Interval for the Long-Running Application

2021 ◽  
pp. 2590-2599
Author(s):  
Yongning Zhai ◽  
Weiwei Li
Keyword(s):  
Distributed Computing ◽  
Performance Optimization ◽  
Fault Tolerant ◽  
Computing System ◽  
Effective Rate ◽  
Performance Degradation ◽  
Numerical Results ◽  
Failure Distribution ◽  
Overhead Ratio

For the distributed computing system, excessive or deficient checkpointing operations would result in severe performance degradation. To minimize the expected computation execution of the long-running application with a general failure distribution, the optimal equidistant checkpoint interval for fault tolerant performance optimization is analyzed and derived in this paper. More precisely, the optimal checkpointing period to determine the proper checkpoint sequence is proposed, and the derivation of the expected effective rate of the defined computation cycle is introduced. Corresponding to the maximal expected effective rate, the constraint of the optimal checkpoint sequence can be obtained. From the constraint of optimality, the optimal equidistant checkpoint interval can be obtained according to the minimal fault tolerant overhead ratio. By the numerical results, the proposal is practical to determine a proper equidistant checkpoint interval for fault tolerant performance optimization.

Edge-bipancyclicity in conditional edge-faulty k-ary n-cubes

2019 ◽  
Vol 53 (3-4) ◽  
pp. 85-113
Author(s):  
Shiying Wang ◽  
Shurong Zhang
Keyword(s):  
Distributed Computing ◽  
Fault Tolerant ◽  
Parallel And Distributed Computing ◽  
Distributed Computing Systems ◽  
Computing Systems

The class of k-ary n-cubes represents the most commonly used interconnection topology for parallel and distributed computing systems. In this paper, we consider the faulty k-ary n-cube with even k ≥ 4 and n ≥ 2 such that each vertex of the k-ary n-cube is incident with at least two healthy edges. Based on this requirement, we investigate the fault-tolerant capabilities of the k-ary n-cube with respect to the edge-bipancyclicity. We prove that in the k-ary n-cube Qnk, every healthy edge is contained in fault-free cycles of even lengths from 6 to |V(Qnk)|, even if the Qnk has up to 4n − 5 edge faults and our result is optimal with respect to the number of edge faults tolerated.

scholarly journals Cryptographic support for fault-tolerant distributed computing

1996 ◽  
Author(s):  
Yaron Minsky ◽  
Robbert van Renesse ◽  
Fred B. Schneider ◽  
Scott D. Stoller
Keyword(s):  
Distributed Computing ◽  
Fault Tolerant
Sign in / Sign up

Export Citation Format

Share Document