An Efficient Solution to the Critical Section Problem

In a distributed system of N sites an efficient solution to the critical section problem is proposed to allow multiple simultaneous entries to the Critical Section. The proposed solution is token-based, deadlock-free and free from starvation. In all cases except during the book keeping cycle of the algorithm, the number of message exchanges per Critical Section execution is less than or equal to 5. Only during the book keeping cycle which is not done very often the number of message exchanges per Critical Section execution reaches to at most N.