Performance optimization of checkpointing schemes with task duplication

Ziv, Avi; Bruck, Jehoshua

doi:10.1109/12.641939

Cited by 50 publications

(25 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A short description of the schemes is given here. A more detailed description and the analysis of those schemes can be found in [19]. The simplest scheme is the TMR-F scheme [11].…”

Section: Scheme Comparisonmentioning

confidence: 99%

“…Using the analysis technique described in Section 2, we calculated the average execution time of the four schemes considered in this section for a task of length one with n checkpoints [19]: Fig . 3 shows the average execution time of a task using each of the four schemes, with overhead time of t oh = 0.002 for each step.…”

Section: Simplified Modelmentioning

confidence: 99%

“…3 shows the average execution time of a task using each of the four schemes, with overhead time of t oh = 0.002 for each step. The number of checkpoints for each scheme is chosen such that its average execution time is minimized [19].…”

Section: Simplified Modelmentioning

confidence: 99%

“…The technique, which is based on modeling the scheme as a discrete time Markov Reward Model (MRM) [8], provides a means to evaluate important parameters in the performance of a scheme. It provides a way to compare various schemes and select optimal values for some parameters of the scheme, like the number of checkpoints [19].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Analysis of checkpointing schemes with task duplication

Ziv

Bruck

1998

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

Abstract-This paper suggests a technique for analyzing the performance of checkpointing schemes with task duplication. We show how this technique can be used to derive the average execution time of a task and other important parameters related to the performance of checkpointing schemes. The analysis results are used to study and compare the performance of four existing checkpointing schemes. Our comparison results show that, in general, the number of processors used, not the complexity of the scheme, has the most effect on the scheme performance.

show abstract

“…A short description of the schemes is given here. A more detailed description and the analysis of those schemes can be found in [19]. The simplest scheme is the TMR-F scheme [11].…”

Section: Scheme Comparisonmentioning

confidence: 99%

Section: Simplified Modelmentioning

confidence: 99%

Section: Simplified Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Analysis of checkpointing schemes with task duplication

Ziv

Bruck

1998

IEEE Trans. Comput.

Self Cite

View full text Add to dashboard Cite

show abstract

“…A checkpoint is placed at time t, t 0 £ t < t 1 The analysis of the modified algorithm is essentially the same as the analysis of the original on-line algorithm that was shown in Lemma 2. The details of the analysis of the modified algorithm can be found in [13]. .…”

Section: The Modified Algorithmmentioning

confidence: 99%

An on-line algorithm for checkpoint placement

Ziv

Bruck

Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering

Self Cite

View full text Add to dashboard Cite

Abstract-Checkpointing enables us to reduce the time to recover from a fault by saving intermediate states of the program in a reliable storage. The length of the intervals between checkpoints affects the execution time of programs. On one hand, long intervals lead to long reprocessing time, while, on the other hand, too frequent checkpointing leads to high checkpointing overhead. In this paper, we present an on-line algorithm for placement of checkpoints. The algorithm uses knowledge of the current cost of a checkpoint when it decides whether or not to place a checkpoint. The total overhead of the execution time when the proposed algorithm is used is smaller than the overhead when fixed intervals are used. Although the proposed algorithm uses only on-line knowledge about the cost of checkpointing, its behavior is close to the off-line optimal algorithm that uses a complete knowledge of checkpointing cost.

show abstract

Checkpointing schemes for Grid workflow systems

Xiang

2008

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYOne of the major challenges in wide use of Grid workflow systems is fault tolerance and avoidance. Checkpointing schemes provide a way of fault detection and recovery. In our research, we focus on the performance optimization of checkpointing schemes and dynamic voltage scaling (DVS) for Grid workflow systems. We propose offline checkpointing schemes with DVS and online adaptive checkpointing schemes that dynamically adjust the checkpointing intervals by using store checkpoints and compare checkpoints. When combined with DVS, offline adaptive checkpointing schemes not only are fault tolerant but also lead to reduce average execution time of tasks. These schemes can efficiently utilize comparison and storage operations and significantly improve the performance. Further, these schemes can calculate the optimal numbers of checkpoints by which the mean execution time can be minimized. We also expand the online adaptive checkpointing schemes from single-task execution scenarios to multi-task execution scenarios. Simulation results show that these online schemes outstandingly increase the likelihood of timely task completion when faults occur.

show abstract

Performance optimization of checkpointing schemes with task duplication

Cited by 50 publications

References 14 publications

Analysis of checkpointing schemes with task duplication

Analysis of checkpointing schemes with task duplication

An on-line algorithm for checkpoint placement

Checkpointing schemes for Grid workflow systems

Contact Info

Product

Resources

About