Please read slides on fault recovery alogrithm prepared by Prof. Gagan first.
Claim: Orphan messages are not acceptable by this algorihm.
Proof: Assume an orphan message M exit between thread Y and Z. Without the loss of generality, consider Z as the sender and Y as the receiver. By definition of orphan message, M must be sent after
t
3
t_3
t3 and received before
t
2
t_2
t2. By the checkpoint algorithm, no message is allowed to sent at the interval between tentative point and commit point. Thus, M could only be sent after
t
5
t_5
t5. In other words,
t
5
<
t
6
t_5 < t_6
t5<t6 and
t
7
<
t
2
t_7 < t_2
t7<t2 .
By checkpoint algorithm, we could obtain the conclusion
t
2
<
t
4
<
t
5
t_2 < t_4 < t_5
t2<t4<t5. Revisit the relations at the end of above paragragh, the final time chain would be
t
7
<
t
6
t_7 < t_6
t7<t6.
Contradiction: The sending time is larger than the receiving time!
扫一扫
2199
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
