共 50 条
How safe is probabilistic checkpointing?
被引:6
|作者:
Elnozahy, EN
[1
]
机构:
[1] IBM Corp, Austin Res Lab, Austin, TX 78758 USA
来源:
TWENTY-EIGHTH ANNUAL INTERNATIONAL SYMPOSIUM ON FAULT-TOLERANT COMPUTING, DIGEST PAPERS
|
1998年
关键词:
D O I:
10.1109/FTCS.1998.689486
中图分类号:
TP3 [计算技术、计算机技术];
学科分类号:
0812 ;
摘要:
Probabilistic checkpointing has been introduced recently as a technique for implementing incremental checkpointing. Supposedly, this new technique is better than traditional ones because it is portable, more efficient, and has lower storage requirements. On the downside, the technique may produce erroneous checkpoints due to a problem called aliasing. However, a probabilistic analysis has shown that the likelihood of aliasing in practice is negligible. This paper presents an empirical study showing that aliasing occurs more frequently than the probabilistic analysis has estimated. The results refute the previous claims about probabilistic checkpointing and establish that it is unsafe in practice.
引用
收藏
页码:358 / 363
页数:6
相关论文