Basic Concepts of Fault-Tolerant Computing Design

Aktouf, Chouki; Guran, Ardéshir; BENKAHLA, OUM-EL-KHEIR

doi:10.1142/9789812819499_0011

Cited by 2 publications

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Replication is a well-known technique for improving availability in an unreliable system. In fault-tolerant computing, replication is also a technique to overcome faults [4,5]. The replication technique has already been favorably utilized in grid computing.…”

Section: Computational Replicationmentioning

confidence: 99%

Improving performance via computational replication on a large-scale computational grid

Mascagni

2003

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.

View full text Add to dashboard Cite

High performance computing on a large-scale computational grid is complicated by the heterogeneous computational capabilities of each node, node unavailability, and unreliable network connectivity. Replicating computation on multiple nodes can significantly improve performance by reducing task completion time on a grid's dynamic environment. We develop an analytical model to determine the number of task replicas to meet the performance goals in different computational grid configurations. Furthermore, taking advantage of the statistical nature of grid-based Monte Carlo applications, we extend the computational replication technique to an N-out-of-M scheduling strategy for grid-based Monte Carlo applications, which can potentially form a large category of grid-computing applications. In addition, we establish a corresponding model for the N-out-of-M scheduling mechanism. Simulations are used to validate the computational replication models. Our preliminary results show that the models we use are effective in predicting the required number of replicas to achieve short task completion time with a given high probability.

show abstract

Section: Computational Replicationmentioning

confidence: 99%

Improving performance via computational replication on a large-scale computational grid

Mascagni

2003

CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings.

View full text Add to dashboard Cite

show abstract

“…It has been used extensively for faulttolerance [10]. In [11] and [12], replication is used as a technique to overcome faults; in [13], dynamic modeldriven replication is used to obtain high data availability; in [14], the replica scheduling of tasks is used to improve the performance of computational grids by reducing the time to solution of Monte Carlo simulations. In [15], data integrity is assessed through the use of reputation systems in fostering trust in uncertain environments (e.g., the Internet).…”

Section: Introductionmentioning

confidence: 99%

Homogeneous Redundancy: a Technique to Ensure Integrity of Molecular Simulation Results Using Public Computing

Taufer

Anderson

Cicotti

et al.

19th IEEE International Parallel and Distributed Processing Symposium

View full text Add to dashboard Cite

Distributed computing using PCs volunteered by the public can provide high computing capacity at low cost. However, computational results from volunteered PCs have a non-negligible error rate, so result validation is needed to ensure overall correctness. A generally applicable technique is "redundant computing", in which each computation is done on several separate computers, and results are accepted only if there is a consensus. Variations in numerical processing between computers (due to a variety of hardware and software factors) can lead to different results for the same task. In some cases, this can be addressed by doing a "fuzzy comparison" of results, so that two results are considered equivalent if they agree within given tolerances. However, this approach is not applicable to applications that are "divergent", that is, for which small numerical differences can produce large differences in the results. In this paper we examine the problem of validating results of divergent applications. We present a novel approach called Homogeneous Redundancy (HR), in which the redundant instances of a computation are dispatched to numerically identical computers, allowing strict equality comparison of the results. HR has been deployed in Predictor@home, a world-wide community effort to predict protein structure from sequence.

show abstract

Basic Concepts of Fault-Tolerant Computing Design

Cited by 2 publications

References 0 publications

Improving performance via computational replication on a large-scale computational grid

Improving performance via computational replication on a large-scale computational grid

Homogeneous Redundancy: a Technique to Ensure Integrity of Molecular Simulation Results Using Public Computing

Contact Info

Product

Resources

About