We present a decentralized, symmetric mutual exclusion algorithm in a computer network. The proposed algorithm has the same message complexity as that of the Maekawa's O(√N) mutual exclusion algorithm and can be applied to arbitrary sizes of distributed systems. It is more suitable than Maekawa's when the symmetry of a system is a criticism. In addition, our algorithm has smaller request set size than that of Gupta, Bruell and Ghosh's mutual exclusion algorithm on a system of size 2n for some integer n.
|Number of pages||4|
|State||Published - 1 Dec 1994|
|Event||Proceedings of the 1994 International Conference on Parallel and Distributed Systems - Hsinchu, China|
Duration: 19 Dec 1994 → 21 Dec 1994
|Conference||Proceedings of the 1994 International Conference on Parallel and Distributed Systems|
|Period||19/12/94 → 21/12/94|