Abstract
Because it has desirable features such as no cascading rollback, fast output commit and asynchronous logging, causal message logging needs a consistent recovery algorithm to tolerate concurrent failures. For this purpose, Elnozahy proposed a centralized recovery algorithm to have two practical benefits, i.e. reducing the number of stable storage accesses and imposing no restriction on the execution of live processes during recovery. However, the algorithm with independent checkpointing may force the system to be in an inconsistent state when processes fail concurrently. In this paper, we identify these inconsistent cases and then present a recovery algorithm to have the two benefits and ensure the system consistency when integrated with any kind of checkpointing protocol. Also, our algorithm requires no additional message compared with Elnozahy's algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 1039-1043 |
| Number of pages | 5 |
| Journal | IEICE Transactions on Information and Systems |
| Volume | E87-D |
| Issue number | 4 |
| Publication status | Published - 2004 Apr |
Keywords
- Check-pointing
- Consistent recovery
- Distributed systems
- Fault-tolerance
- Message logging
ASJC Scopus subject areas
- Software
- Hardware and Architecture
- Computer Vision and Pattern Recognition
- Electrical and Electronic Engineering
- Artificial Intelligence