On distributed snapshots
Information Processing LettersPublished 1 May 1987
Ten H. Lai, Tao Yang
Citations207
SJR quartileQ3
SJR score0.41
SNIP0.73
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We develop an efficient snapshot algorithm that needs no control messages and does not require channels to be first-in-first-out. We also show that several stable properties (e.g., termination, deadlock) can be detected with uncoordinated distributed snapshots. For such properties, our algorithm can be further simplified.
Keywords
Computer Science
ACM Transactions on Computer SystemsDistributed snapshots
2,439 Citations1985K. Mani Chandy, Leslie Lamport
Communications of the ACMSelf-stabilizing systems in spite of distributed control
2,098 Citations1974Edsger W. Dijkstra
The synchronization task between loosely coupled cyclic sequential processes (as can be distinguished in, for instance, operating systems) can be viewed as keeping the relation “the system is in a legitimate state” invariant.
ACM Transactions on Computer SystemsDistributed deadlock detection
393 Citations1983K. Mani Chandy, Jayadev Misra +1 more
It is shown that all true deadlocks are detected and that no false deadlock reported, and the algorithms can be applied in distributed database and other message communication systems.
IEEE Transactions on Software EngineeringAchieving Distributed Termination without Freezing
96 Citations1982Nissim Francez, Michael Rodeh
An efficient algorithm for achieving distributed termination without introducing new communicaton channels and without delaying the basic computations ("freezing") is presented.
Information Processing LettersTermination detection for distributed computations
86 Citations1984Rodney Topor
A simple derivation of a general solution to the problem of detecting the termination of a distributed computation is presented.
Information Processing LettersGlobal and logical time in distributed algorithms
40 Citations1985Carroll Morgan
It is shown that in some cases global time can be assumed while designing an algorithm, but need not be implemented—in these cases it can be replaced with Lamport's logical time in a routine manner, which clearly preserves the correctness of the algorithm.
Journal of Parallel and Distributed ComputingTermination detection for dynamically distributed systems with non-first-in-first-out communication
32 Citations1986Ten‐Hwang Lai
A new algorithm for detecting termination of distributed systems that works correctly whether the system is static or dynamic, whether the interprocess communication is synchronous or asynchronous, and whether the communication channels are first-in-first-out or not is proposed.
The Distributed Snapshot of K.M. Chandy and L. Lamport
9 Citations1986Edsger W. Dijkstra
This work considers a distributed system of the form of a strongly connected, finite, directed graph, of which each vertex is a machine and each edge a uni-directional first-in-first-out buffer of sufficient capacity.