Chapter 4 – Synchronization

Distributed Systems

Chapter 4 –  Synchronization

Important Questions from Chapter 4 –  Synchronization

1. What happens if two processes detect failure of the coordinator simultaneously and both decide to hold election? Explain.

2. Explain the Lamport's happens before relation along with the conditions. How are Lamport's logical clocks implemented?

3. Explain algorithms for distributed deadlock detection.

4. By using Cristian’s algorithm, how clock is synchronized?

5. Explain Averaging algorithm.

6. Explain Berkeley algorithm for clock synchronization

7. Explain importance of ordered message delivery.

8. Explain mutual  exclusion algorithms

9. Compare mutual  exclusion algorithms.

10. Explain process of electing new coordinator.

11. Explain Bully algorithm.
12. How token ring algorithm is implemented?
13. Explain transaction model implementation in detail.