Using logical rings to solve the distributed mutual exclusion problem withfault tolerance issues

In this paper, we investigate distributed mutual exclusion algorithms and d elineate the features of a new distributed mutual exclusion algorithm. The basis of the algorithm is the logical ring structure employed in token-base d mutual exclusion algorithms. Specifically, there exists dynamic propertie s of the logical ring that, given certain restrictions regarding message tr affic flow, passively give useful information about the location of the tok en. Effectively, the algorithm demonstrates a type of "intelligent routing" that identifies useful shortcuts in the routing of the token. The result i s a reduction in the total number of messages exchanged prior to the execut ion of the critical section as compared to the algorithm proposed by Fu and Tzeng [3]. Furthermore, the algorithm allows for an increased degree of fa irness in a lightly loaded system than that allowed by Fu and Tzeng's algor ithm. The paper also addresses failure recovery issues.