Distributed snapshots
- 1 February 1985
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 3 (1) , 63-75
- https://doi.org/10.1145/214451.214456
Abstract
This paper presents an algorithm by which a process in a distributed system determines a global state of the system during a computation. Many problems in distributed systems can be cast in terms of the problem of detecting global states. For instance, the global state detection algorithm helps to solve an important class of problems: stable property detection. A stable property is one that persists: once a stable property becomes true it remains true thereafter. Examples of stable properties are “computation has terminated,” “ the system is deadlocked” and “all tokens in a token ring have disappeared.” The stable property detection problem is that of devising algorithms to detect a given stable property. Global state detection can also be used for checkpointing.Keywords
This publication has 8 references indexed in Scilit:
- Distributed deadlock detectionACM Transactions on Computer Systems, 1983
- Distributed computation on graphsCommunications of the ACM, 1982
- Distributed deadlock detection algorithmACM Transactions on Database Systems, 1982
- Termination Detection of Diffusing Computations in Communicating Sequential ProcessesACM Transactions on Programming Languages and Systems, 1982
- On Deadlock Detection in Distributed SystemsIEEE Transactions on Software Engineering, 1980
- Termination detection for diffusing computationsInformation Processing Letters, 1980
- Locking and Deadlock Detection in Distributed Data BasesIEEE Transactions on Software Engineering, 1979
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978