A distributed mutual exclusion solution derived from real-life examples
Rajeev Chawla · 1992
This paper presents a distributed mutual exclusion solution which is derived from a real-life situation which requires mutual exclusion. The proposed algorithm uses a dynamic information structure and requires between 0 and N message exchanges per critical section invocation, where N is the number of nodes in the network. The algorithm is also proved to be free from deadlock and starvation.