Distributed snapshots

  • Chandy K
  • Lamport L
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Chandy, K. M., & Lamport, L. (1985). Distributed snapshots. ACM Transactions on Computer Systems, 3(1), 63–75. https://doi.org/10.1145/214451.214456

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free