How to recover efficiently and asynchronously when optimism fails

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 message...

Full description

Bibliographic Details

Published in:	Proceedings of the 16th International Conference on Distributed Computing Systems pp. 108 - 115
Main Authors:	Damani, O.P., Garg, V.K.
Format:	Conference Proceeding
Language:	English
Published:	IEEE 1996
Subjects:	Checkpointing Clocks Costs Distributed computing Fault detection Fault tolerance History Protocols
ISBN:	9780818673993, 0818673990
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!