*** This is a modification to Ricart–Agrawala algorithm[2] in which a REQUEST and REPLY message are used for attaining the critical section, but in this algorithm, a method was introduced in which a seniority vise and also by handing over the critical section to other node by sending a single PRIVILEGE message to other node.
So, the node which has the privilege it can use the critical section and if it does not have one it cannot.
If a process wants to enter its critical section and it does not have the token, it broadcasts a request message to all other processes in the system.
The algorithm makes use of increasing Request Numbers to allow messages to arrive out-of-order.
wants to enter the CS, if it does not have the token, it: When process
, it: A process enters the CS when it has acquired the token.
The main design issues of the algorithm: