DMCA
How to Recover Efficiently and Asynchronously when Optimism Fails (1996)
Cached
Download Links
| Venue: | IN PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS |
| Citations: | 49 - 5 self |
BibTeX
@INPROCEEDINGS{Damani96howto,
author = {Om P. Damani and Vijay K. Garg},
title = {How to Recover Efficiently and Asynchronously when Optimism Fails},
booktitle = {IN PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON DISTRIBUTED COMPUTING SYSTEMS},
year = {1996},
pages = {108--115},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock to maintain causality information in spite of failures, and a history mechanism to detect orphan states and obsolete messages. These two mechanisms together with checkpointing and message-logging are used to restore the system to a consistent state after a failure of one or more processes. Our algorithm is completely asynchronous. It handles multiple failures, does not assume any message ordering, causes the minimum amount of rollback and restores the maximum recoverable state with low overhead. Earlier optimistic protocols lack one or more of the above properties.
Keyphrases
optimism fails maximum recoverable state causality information obsolete message distributed computation minimum amount consistent state fault-tolerant vector clock message ordering multiple failure new algorithm optimistic protocol low overhead novel concept orphan state history mechanism
