Jin Ho Ahn , Seong Jun Bang

The KIPS Transactions:PartA, Vol. 13, No. 6, pp. 525-532, Dec. 2006
10.3745/KIPSTA.2006.13.6.525,   PDF Download:

Abstract

Compared with the previous recovery algorithms for causal message logging, Elnozahy's recovery algorithm considerably reduces the number of stable storage accesses and enables live processes to execute their computations continuously while performing its recovery procedure. However, if causal message logging is used with asynchronous checkpointing, the state of the system may be inconsistent after having executed this algorithm in case of concurrent failures. In this paper, we show these inconsistent cases and propose a low-cost recovery algorithm for causal messge logging to solve the problem. To ensure the system consistency, this algorithm allows the recovery leader to obtain recovery information from not only the live processes, but also the other recovering processes. Also, the proposed algorithm requires no extra message compared with Elnozahy's one and its additional overhead incurred by message piggybacking is significantly low. To demonstrate this, simulation results show that the first only increase about 1.0%～2.1% of the recovery information collection time compared with the latter.

Statistics
Cite this article