Ricarts Agrawala Algorithm for Mutual Exclusion

• it is same as lamport's algorithm but with modified version.

• It overcomes disadvantages of lamport's algorithm.

• We have some processes & they want to execute, to execute many times they need some resources. These
resources are kept inside shared resources section within CS.so to get these resources, processes need to
access CS.
• Problem is at a time only one process can access CS.If more than one process trying to access CS then
deadlock will occur.
To avoid this deadlock, we use mutual exclusion

•Mutual exclusion :it make sure that processes accesses shared resources in serialized manner .