Efficient distributed recovery using message logging

Published 1 January 1989

A. Prasad Sistla, Jennifer L. Welch

Citations171

TL;DR

Algorithm for recovery on networks, in which each process only communicates with its neighbors, and how to decompose large networks into smaller networks so that each of the smaller network can use a different recovery procedure.

Abstract

Article Efficient distributed recovery using message logging Share on Authors: A. P. Sistla GTE Laboratories Incorporated GTE Laboratories IncorporatedView Profile , J. L. Welch GTE Laboratories Incorporated GTE Laboratories IncorporatedView Profile Authors Info & Claims PODC '89: Proceedings of the eighth annual ACM Symposium on Principles of distributed computingJune 1989 Pages 223–238https://doi.org/10.1145/72981.72997Online:01 June 1989Publication History 114citation572DownloadsMetricsTotal Citations114Total Downloads572Last 12 Months9Last 6 weeks2 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteGet Access

Keywords

Computer Science

Communications of the ACMTime, clocks, and the ordering of events in a distributed system

8,437 Citations1978Leslie Lamport

A distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events, and a bound is derived on how far out of synchrony the clocks can become.

View PDF

ACM Transactions on Computer SystemsDistributed snapshots

2,439 Citations1985K. Mani Chandy, Leslie Lamport

View PDF

IEEE Transactions on Software EngineeringCheckpointing and Rollback-Recovery for Distributed Systems

827 Citations1987Richard Koo, Sam Toueg

This work describes a distributed algorithm to create consistent checkpoints, as well as a rollback-recovery algorithm to recover the system to a consistent state by tolerating failures that occur during their executions.

Hierarchical correctness proofs for distributed algorithms

767 Citations1987Nancy Lynch, Mark R. Tuttle

This thesis introduces a new model for distributed computation in asynchronous networks, the input-output automaton, which captures in a novel way the game-theoretical interaction between a system and its environment and allows fundamental properties of distributed computation to be naturally expressed.

View PDF

ACM Transactions on Computer SystemsOptimistic recovery in distributed systems

722 Citations1985Rob Strom, Shaula Yemini

Optimistic Recovery is a new technique supporting application-independent transparent recovery from processor failures in distributed systems that can tolerate the failure of an arbitrary number of processors and yields better throughput and response time than other general recovery techniques whenever failures are infrequent.

View PDF

ACM SIGOPS Operating Systems ReviewA message system supporting fault tolerance

245 Citations1983Anita Borg, Jim Baumbach +1 more

View PDF

ACM SIGOPS Operating Systems ReviewPublishing

169 Citations1983Michael Powell, David L. Presotto

View PDF

A Paradigm for Detecting Quiescent Properties in Distributed Computations

25 Citations1985K. Mani Chandy, Jayadev Misra

This paper presents a simple (almost trivial) algorithm to detect quiescent properties, an important class of stable properties including those mentioned above.