Y. Yan, X. Zhang and H. Yang
``A Fast Token-Chasing
Mutual Exclusion Algorithm in Arbitrary Network Topologies"
 
Journal of Parallel and Distributed Computing, Vol. 35, No. 2, 1996. 
 
Abstract
--------
 
We present a
simple and efficient mutual exclusion algorithm which has
the message passing complexity of 0 $\sim$ $2N$, where $N$ is the
number of processors in the network. This algorithm
reduces its message passing
complexity by a token-chasing method, and enhances its effectiveness
by dynamically adjusting state information stored
in each processor.
We have conducted a group of experiments on a network of workstations
environment for
comparative performance evaluation between our algorithm and two other
existing mutual exclusion algorithms.
The experimental results show the effectiveness of our algorithm,
especially when a large number of requests accesses
the critical region in a distributed system.