Skip to search formSkip to main contentSkip to account menu

Chandy-Lamport algorithm

The Chandy–Lamport algorithm is a snapshot algorithm that is used in distributed systems for recording a consistent global state of an asynchronous… 
Wikipedia (opens in a new tab)

Related topics

Related topics

5 relations
Dijkstra PrizeFIFO (computing and electronics)Internet protocol suiteList of algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Hierarchical composition of coordinated checkpoint with pessimistic message logging
Grid computing mutualizes more computing resources working in a calculation or a common task. The increase in the number of… 
Review
2010
Review
2010
A Review of Checkpointing Fault Tolerance Techniques in Distributed Mobile Systems
Fault Tolerance Techniques enable systems to perform tasks in the presence of faults. A checkpoint is a local state of a process… 
2010
2010
Conservative vs. optimistic parallel simulation of DEVS and Cell-DEVS: a comparative study
The conservative Parallel DEVS protocol offers a novel approach that allows conservative simulation of DEVS-based PDES systems… 
2005
2005
The Impact of Laziness on the Performance of Snapshot Algorithms
A snapshot algorithm gathers global state in a distributed system. Co-ordinated snapshot algorithms, such as the Chandy-Lamport… 
2002
2002
20世紀の名著名論：Dijkstra E.W. Lamport L.. et al.: On -the- Fly Garbage Collection: An Exercise in Cooperation
1993
1993
Simulating synchronized clocks and common knowledge in distributed systems
Time and knowledge are studied in synchronous and asynchronous distributed systems. A large class of problems that can be solved… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)