article

Free access

Distributed snapshots: determining global states of distributed systems

Editor: Anita K. Jones Authors:

K. Mani Chandy,

Leslie LamportAuthors Info & Claims

ACM Transactions on Computer Systems (TOCS), Volume 3, Issue 1

Pages 63 - 75

https://doi.org/10.1145/214451.214456

Published: 01 February 1985 Publication History

PDF eReader

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.

References

[1]

CHANDY, K. M., AND MISRA, J. Distributed computation on graphs: Shortest path algorithms. Cornmun. ACM 25, 11 (Nov. 1982), 833-837.

Crossref

Google Scholar

[2]

CHANDY, K. M., MISRA, J., AND HAAS, L. Distributed deadlock detection. ACM Trans. Cornput. Syst. 1, 2 (May 1983), 144-156.

Crossref

Google Scholar

[3]

DIJKSTRA, E.W. The distributed snapshot of K. M. Chandy and L. Lamport. Tech. Rep. EWD 864a, Univ. of Texas, Austin, Tex., 1984.

Google Scholar

[4]

DIJKSTRA, E. W., AND SCHOLTEN, C.S. Termination detection for diffusing computations. Inf. Proc. Lett. 11, 1 (Aug. 1980), 1-4.

Google Scholar

[5]

GLIGOR, V. D., AND SHATTUCK, S.H. Deadlock detection in distributed systems. IEEE Trans. Softw. Eng. SE-6, 5 (Sep. 1980), 435-440.

Google Scholar

[6]

LAMPORT, L. Time, clocks, and the ordering of events in a distributed system. Cornrnun. ACM 21, 7 (Jul. 1978), 558-565.

Crossref

Google Scholar

[7]

LAMPORT, L., AND CHANDY, K.M. On partially-ordered event models of distributed computations. Submitted for publication.

Google Scholar

[8]

MAHOUD, S. A., AND RIORDAN, J. S. Software controlled access to distributed databases. INFOR 15, 1 (Feb. 1977), 22-36.

Google Scholar

[9]

MENASCE, D., AND MUNTZ, R. Locking and deadlock detection in distributed data bases. IEEE Trans. Softw. Eng. SE-5, 3 (May 1979), 195-202.

Google Scholar

[10]

MISRA, J., AND CHANDY, K.M. Termination detection of diffusing computations in communicating sequential processes. ACM Trans. Program. Lang. Syst. 4, 1 (Jan. 1982), 37-43.

Crossref

Google Scholar

[11]

OBERMARCK, R. Distributed deadlock detection algorithm. A CM Trans. Database Syst. 7, 2 (Jun. 1982), 187-208.

Crossref

Google Scholar

Cited By

View all

Namjoshi KGheissi SSabnani KSekar VYu MSeneviratne AVeitch D(2024)Algorithms for In-Place, Consistent Network UpdateProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672266(244-257)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672266
Castello JRedmond PKuper L(2024)Inductive Diagrams for Causal ReasoningProceedings of the ACM on Programming Languages10.1145/36498308:OOPSLA1(529-554)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649830
Benoit APerotin LRobert YVivien F(2024)Checkpointing Strategies to Tolerate Non-Memoryless Failures on HPC PlatformsACM Transactions on Parallel Computing10.1145/362456011:1(1-26)Online publication date: 11-Mar-2024
https://dl.acm.org/doi/10.1145/3624560
Show More Cited By

Index Terms

Recommendations

Detecting Arbitrary Stable Properties Using Efficient Snapshots

A stable property continues to hold in an execution once it becomes true. Detecting arbitrary stable properties efficiently in distributed executions is still an open problem. The known algorithms for detecting arbitrary stable properties and snapshot ...
Distributed snapshots for ad hoc network systems
Grid and P2P Systems

Snapshot algorithms are fundamental algorithms in recording consistent global states of a distributed system. They find a large class of important applications such as monitoring and debugging of distributed systems and detection of stable properties (...
Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation
Special issue on parallel and discrete event simulation

This paper presents snapshot algorithms for determining a consistent global state of a distributed system without significantly affecting the underlying computation. These algorithms do not require channels to be FIFO or messages to be acknowledged. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Computer Systems

ACM Transactions on Computer Systems Volume 3, Issue 1

Feb. 1985

75 pages

ISSN:0734-2071

EISSN:1557-7333

DOI:10.1145/214451

Editor:
Anita K. Jones

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 1985

Published in TOCS Volume 3, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1,961
Total Citations
View Citations
13,467
Total Downloads

Downloads (Last 12 months)1,008
Downloads (Last 6 weeks)70

Reflects downloads up to 11 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Namjoshi KGheissi SSabnani KSekar VYu MSeneviratne AVeitch D(2024)Algorithms for In-Place, Consistent Network UpdateProceedings of the ACM SIGCOMM 2024 Conference10.1145/3651890.3672266(244-257)Online publication date: 4-Aug-2024
https://dl.acm.org/doi/10.1145/3651890.3672266
Castello JRedmond PKuper L(2024)Inductive Diagrams for Causal ReasoningProceedings of the ACM on Programming Languages10.1145/36498308:OOPSLA1(529-554)Online publication date: 29-Apr-2024
https://dl.acm.org/doi/10.1145/3649830
Benoit APerotin LRobert YVivien F(2024)Checkpointing Strategies to Tolerate Non-Memoryless Failures on HPC PlatformsACM Transactions on Parallel Computing10.1145/362456011:1(1-26)Online publication date: 11-Mar-2024
https://dl.acm.org/doi/10.1145/3624560
Bachan JYe JJiang XNguyen TNatarajan MBremer MChan C(2024)Devastator: A Scalable Parallel Discrete Event Simulation Framework for Modern C++Proceedings of the 38th ACM SIGSIM Conference on Principles of Advanced Discrete Simulation10.1145/3615979.3656061(35-46)Online publication date: 24-Jun-2024
https://dl.acm.org/doi/10.1145/3615979.3656061
Sun HHuang QLee PBai WZhu FBao Y(2024)Distributed Network Telemetry With Resource Efficiency and Full AccuracyIEEE/ACM Transactions on Networking10.1109/TNET.2023.332734532:3(1857-1872)Online publication date: Jun-2024
https://doi.org/10.1109/TNET.2023.3327345
Siachamis GPsarakis KFragkoulis Mvan Deursen ACarbone PKatsifodimos A(2024)CheckMate: Evaluating Checkpointing Protocols for Streaming Dataflows2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00309(4030-4043)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00309
Pashazadeh SAl-Basseer BTanha J(2024)Modeling Chandy–Lamport Distributed Snapshot Algorithm Using Colored Petri NetIET Software10.1049/2024/65826822024:1Online publication date: 7-Jun-2024
https://doi.org/10.1049/2024/6582682
Bautista-Gomez LBenoit ADi SHerault TRobert YSun H(2024)A survey on checkpointing strategies: Should we always checkpoint à la Young/Daly?Future Generation Computer Systems10.1016/j.future.2024.07.022161(315-328)Online publication date: Dec-2024
https://doi.org/10.1016/j.future.2024.07.022
Isukapalli SSrirama S(2024)A systematic survey on fault-tolerant solutions for distributed data analytics: Taxonomy, comparison, and future directionsComputer Science Review10.1016/j.cosrev.2024.10066053(100660)Online publication date: Aug-2024
https://doi.org/10.1016/j.cosrev.2024.100660
Rahhali MGarcia TSpiteri P(2024)Parallel cloud solution of large algebraic multivalued systemsApplied Numerical Mathematics10.1016/j.apnum.2024.03.012Online publication date: Mar-2024
https://doi.org/10.1016/j.apnum.2024.03.012
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Index Terms

Recommendations

Detecting Arbitrary Stable Properties Using Efficient Snapshots

Distributed snapshots for ad hoc network systems

Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations