If you are experiencing problems downloading PDF or HTML fulltext, our helpdesk recommend clearing your browser cache and trying again. If you need help in clearing your cache, please click here . Still need help? Email help@ingentaconnect.com

A Log (N) Distributed Mutual Exclusion Algorithm Based on Path Reversal

The full text article is not available for purchase.

The publisher only permits individual articles to be downloaded by subscribers.


In this paper, we present a distributed algorithm for mutual exclusion based on path reversal. The algorithm does not use logical clocks to serialize the concurrent events, and all the variables are bounded. When a process invokes a critical section, it sends a request to the tail of a queue. A dynamical rooted tree gives the path to this tail. The algorithm requires only O (log( n )) messages on average, where n is the number of processes in the network. The performance analysis of the algorithm is based on generating formal power series.

Document Type: Research Article

Affiliations: 1: LIB, Faculte des sciences, Route de Gray, Besancon Cedex, 25030, France 2: LaBRI, Universite Bordeaux I, Talence Cedex, 33405, France

Publication date: April 1, 1996

Related content



Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more