Ricart–Agrawala algorithm: Difference between revisions

Content deleted Content added
Problems faced in Ricart's Algorithm
Line 29:
=== Common Optimizations ===
Once site <math>P_i</math> has received a <math>reply</math> message from site <math>P_j</math>, site <math>P_i</math> may enter the critical section without receiving permission from <math>P_j</math> until <math>P_i</math> has sent a <math>reply</math> message to <math>P_j</math>
 
=== Problems ===
One of the problems in this algorithm is failure of a node. In such a situation a process may starve forever.
This problem can be solved by detecting failure of nodes after some timeout.
 
== See also ==