The simulator visualizes a network of processes connected by channels, showing markers propagating outward from an initiating process, each process recording its local state on first marker receipt, and channels accumulating in-flight messages until they too receive a marker, ultimately assembling into one consistent global snapshot.
Choose a process to initiate the snapshot and watch it record its state and fire markers along every outgoing channel. Step through time to see neighboring processes receive markers, record their own states, and forward markers onward, while messages arriving on still-unmarked channels get captured as in-flight state. Continue until every channel has delivered its marker and the full snapshot is complete.
Select an initiating process, step through marker propagation event by event or play it continuously, inspect each process's recorded local state and each channel's recorded in-flight messages, and reset to try a different initiator or message timing scenario.
The Chandy-Lamport algorithm was published in 1985 by K. Mani Chandy and Leslie Lamport, the same Lamport whose earlier work on logical clocks and the happened-before relation laid the theoretical groundwork that makes reasoning about consistent global states in an unsynchronized network possible at all.
The simulator visualizes a network of processes connected by channels, showing markers propagating outward from an initiating process, each process recording its local state on first marker receipt, and channels accumulating in-flight messages until they too receive a marker, ultimately assembling into one consistent global snapshot.
The simulator visualizes a network of processes connected by channels, showing markers propagating outward from an initiating process, each process recording its local state on first marker receipt, and channels accumulating in-flight messages until they too receive a marker, ultimately assembling into one consistent global snapshot.
Choose a process to initiate the snapshot and watch it record its state and fire markers along every outgoing channel. Step through time to see neighboring processes receive markers, record their own states, and forward markers onward, while messages arriving on still-unmarked channels get captured as in-flight state. Continue until every channel has delivered its marker and the full snapshot is complete.
The Chandy-Lamport algorithm was published in 1985 by K. Mani Chandy and Leslie Lamport, the same Lamport whose earlier work on logical clocks and the happened-before relation laid the theoretical groundwork that makes reasoning about consistent global states in an unsynchronized network possible at all.