Assignment 3: Global State

1. Can two nodes initiate the Chandi Lamport algorithm in a distributed system? What happens then?

2. If two identical distributed system uses the Chandy Lamport algorithm to record global states at the same time, will the recorded state be identical?

3. Devise the definitions of Local and Global snapshot using formal notations (you can define your own version, not necessarily the one taught in class). Further derive, from your definition, when your global snapshot is consistent, inconsistent, transitless, and strongly consistent.

4. Analyze the worst case message complexity for the Chandy-Lamport Algorithm.

5. Define gloabal and local states formally.

6. Why channel states are needed to be recorded?

7. What do you mean when a global state is transitless? Is this good or bad?

8. What do you mean when a gloanl state is strongly consistant? Exaplin by drawing an example.

9. Exaplain by drawing an exaple what do you mean by an inconsistant global state.

10. Write down the Chandi Lamport algorithm for global state recording.

11. Exaplain the message complexity of Chandi Lamport algorithm.

12. Why Chandi lamport requires FIFO channel?