Open In App

Ricart–Agrawala Algorithm in Mutual Exclusion in Distributed System

Prerequisite: Mutual exclusion in distributed systems 

Ricart–Agrawala algorithm is an algorithm for mutual exclusion in a distributed system proposed by Glenn Ricart and Ashok Agrawala. This algorithm is an extension and optimization of Lamport’s Distributed Mutual Exclusion Algorithm. Like Lamport’s Algorithm, it also follows permission-based approach to ensure mutual exclusion. In this algorithm:

Algorithm:

Message Complexity: Ricart–Agrawala algorithm requires invocation of 2(N – 1) messages per critical section execution. These 2(N – 1) messages involves

Advantages of the Ricart-Agrawala Algorithm:

Drawbacks of Ricart–Agrawala algorithm:

Performance:

Article Tags :