ANALYSIS OF ROUCAIROL AND CARVALHO APPROACH IN DISTRIBUTED MUTUAL EXCLUSION (original) (raw)

Critical section problem is a well known problem in Computer Science. It arises when multiple processes or threads simultaneously try to access shared resources like physical devices or logical objects. In Conventional Operating System Design, we use semaphores to solve this one. In Distributed System due to absence of shared memory we cannot implement the same solution. Various approaches are given to solve the critical section problem in Distributed System. An algorithm that solves critical section problem should have following properties like fairness along with deadlock freedom, freedom from starvation and fault tolerant. Ricart and Agrawala suggested message based approach to get mutual exclusion in Distributed System. This approach fairly deals with the critical section problem. Roucairol and Carvalho suggested an optimization for the given approach. This paper is shedding lights on the proposed optimization. This paper finally concludes that though the optimization has a better performance over the original one yet this one is compromising with the fairness.