Achieving mutual exclusion in a distributed computing environment

Abstract A distributed control algorithm, called MEAL, is presented for achieving mutual exclusion in a distributed computing environment. It requires only ( N + 2) messages per critical section entry, in the no failures case; N being the number of nodes in the distributed system. Few assertions are proved to verify the correct functioning of MEAL. Possible modification to make it resilient, in case of node failures, are also suggested.