Replicated invocations in wide-area systems
Proceedings of the 8th ACM SIGOPS European workshop on Support for composing distributed applications
| Hi-index | 0.00 |
This paper presents a new algorithm for supporting fault tolerant objects in distributed systems. The fault tolerance provided by the algorithm is fully user transparent. The algorithm uses a variation of object replication scheme, which we call the Hot Replication Scheme. The algorithm supports nested object invocations. The chief advantages of the scheme are a) no action is needed in the case of failure of a secondary replica, b) the time to recover from a primary failure is minimal (this time is needed only if the secondary execution speed is slower compared to the primary execution speed), and c) separation of replication protocol and reliable communication protocol. To recover from a primary failure, the designated secondary has to just catch up to the primary state by processing outstanding messages, if any. This is in contrast with the checkpointing and rollback recovery scheme, where the recovery time can be substantial. Our algorithm exploits the general features and concepts associated with the notion of the objects and object interactions to its advantage.