Comparative Study of Mutual Exclusion in Distributed Environment

The traditional mutual exclusion problem in distributed systems occurs when only one process should access a shared resource. The mutual exclusion algorithm performance is calculated by the number of messages exchange per critical section execution called Message complexity and the delay between successive executions of the critical section, known as Synchronization delay. For designing mutual exclusion algorithm, one has to compromise either for the message complexity or for the synchronization delay. Hence a comparative study based on these two metrics is performed. An organized approach is essential to solve Mutual exclusion problem. This study will provide a suitable context for technical and clear assessment of existing algorithms