International Journal of Electrical, Electronics and Computer Engineering (IJEECE)
A distributed system consists of a collection of geographically dispersed autonomous sites connected by a communication network. The sites have no shared memory and communicate with one another by passing messages. To achieve mutual exclusion concurrent access to a shared resource or the Critical Section (CS) must be synchronized such that at any time only one process can access the CS. Over the past decade, many algorithms to achieve mutual exclusion in distributed systems have been proposed. Those algorithms have succeeded in minimizing either message traffic or time delay.