Assignment 6: Mututal exclusion

1. Write in your own words (use points) what do you undersand by mutual exlusion in the context of distributed system. Give an example system that you may design and identify where you might need to solve this problem

2. What are the four requirements for distributed mutual exclusion. Explain in your own words (1-2 lines each).

3. Analyse why Ricart-Agarwala algorithm does not require FIFO, but the Lamport’s algorithm does.

4. What improvement is done by Roucairol-Carvalho Algorithm over Ricart-Agarwala.

5. Show using an example how Maekawa algorithm is able to achieve the “safety” requirement for distributed murual exclusion.

6. Differentiate between token based and non-token based mutual exclusion algorithms

7. Why the complexity measure for mutual exclusion is "number of messages per critical section entry" used?

8. Analyze the complexity of Lamport mutual exclusion algorithm.

9. How is Lamport logical clock used in Lamport mutual exclusion algorithm? How is total order achieved? What is the problem is total order is not enforced?

10. Explain the role of RELEASE message in Lamport mutual exclusion algorithm.