Skip to main content
Article thumbnail
Location of Repository

Completely Asynchronous Optimistic Recovery with Minimal Rollbacks

By et al. Sean W. Smith

Abstract

Consider the problem of transparently recovering an asynchronous distributed computation when one or more processes fail. Basing rollback recovery on optimistic message logging and replay is desirable for several reasons, including not requiring synchronization between processes during failure-free operation. Howevel; previous optimistic rollback recovery protocols either have required synchro-nization during recovery, or have permitted a failure at one process to potentially trigger an exponential number of process rollbacks. In this papel; we present an optimistic rollback recovery protocol that provides completely asyn-chronous recovery, while also reducing the number of times a process must roll back in response to a failure to at most one. This protocol is based on comparing timestamp vectors across multiple levels of partial order time

Year: 1995
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.1387
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.rice.edu/~dbj/pu... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.