Name
Abstract | ||
|---|---|---|
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 performances analysis of the algorithm is based on generating formal power series. |
Year | DOI | Venue |
|---|---|---|
1996 | 10.1006/jpdc.1996.0041 | J. Parallel Distrib. Comput. |
Keywords | Field | DocType |
dyck words,path reversal,logical rooted tree,mutual exclusion algorithm,path reversal.,index terms distributed algorithm,distributed variables,mutual exclusion,distributed algorithm,indexing terms,critical section,formal power series | Suzuki-Kasami algorithm,Maekawa's algorithm,Computer science,Queue,Critical section,Logical clock,Formal power series,Algorithm,Theoretical computer science,Distributed algorithm,Mutual exclusion,Distributed computing | Journal |
Volume | Issue | ISSN |
34 | 1 | Journal of Parallel and Distributed Computing |
Citations | PageRank | References |
83 | 3.11 | 10 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohamed Naimi | 1 | 196 | 16.15 |
| Michel Trehel | 2 | 145 | 9.90 |
| André Arnold | 3 | 83 | 3.11 |