Proceedings of ISSRE '96: 7th International Symposium on Software Reliability Engineering
DOI: 10.1109/issre.1996.558869
|View full text |Cite
|
Sign up to set email alerts
|

An on-line algorithm for checkpoint placement

Abstract: 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 … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
35
0

Publication Types

Select...
5
4

Relationship

0
9

Authors

Journals

citations
Cited by 24 publications
(35 citation statements)
references
References 11 publications
(13 reference statements)
0
35
0
Order By: Relevance
“…Considering various model variations, several papers analyse the problem of optimal checkpointing to minimize average completion time; for example, [7]- [9], [19], [20], [25]- [27]. However, to the best of our knowledge, except for the recent work listed above, none of these papers analyse the completion time tail.…”
Section: Related Workmentioning
confidence: 99%
“…Considering various model variations, several papers analyse the problem of optimal checkpointing to minimize average completion time; for example, [7]- [9], [19], [20], [25]- [27]. However, to the best of our knowledge, except for the recent work listed above, none of these papers analyse the completion time tail.…”
Section: Related Workmentioning
confidence: 99%
“…Instead of using the execution time as a metric, in [20], the authors presented an online algorithm for the placement of checkpoints. This algorithm keeps track of the size of the state of a program and a checkpoint is made when it is small.…”
Section: Related Workmentioning
confidence: 99%
“…In [12], Krishna et al point out that the optimization criteria for checkpoint placement is to trade the benefits derived from checkpointing with the overhead imposed. Ziv and Bruck [24] present an online algorithm for placement of checkpoints. The algorithm keeps track of the state size of a program, and looks for points in the program where checkpoint placement is the most beneficiary.…”
Section: Related Workmentioning
confidence: 99%