An Efficient Distributed Token-Based Mutual Exculsion Algorithm with Central Coordinator

doi:10.1006/jpdc.2002.1847

Journal of Parallel and Distributed Computing

Volume 62, Issue 10, October 2002, Pages 1602-1613

https://doi.org/10.1006/jpdc.2002.1847 Get rights and content

Abstract

A new distributed mutual exclusion algorithm is proposed in this paper. This algorithm is a centralized token-based algorithm. An improvement of the synchronization delay for centralized mutual exclusion in distributed systems is achieved by modifying the standard algorithm for centralized mutual exclusion by a forwarding mechanism that allows tokens to be passed directly between requesters instead of always going through a centralized coordinator. Performance metrics such as synchronization delay, messages per request, and response time under light and heavy loads, are presented. Analysis shows that this algorithm outperforms existing algorithms and its performance is close to the lower bounds of these metrics.

References (18)

M. Naimi et al.
A log(N) distributed mutual exclusion algorithm based on path reversal
J. Parallel Distrib. Comput.
(1996)
M. Singhal
A taxonomy of distributed mutual exclusion
J. Parallel Distrib. Comput.
(1993)
O.S.F. Carvallo et al.
On mutual exclusion in computer networks
Comm. ACM
(February 1983)
Y. Chang, M. Singhal, and M. Liu, A fault tolerant algorithm for distributed mutual exclusion, inProceedings of Ninth...
D.M. Dhamdhere et al.
A token based k resilient mutual exclusion algorithm for distributed mutual exclusion
Inform. Process. Lett.
(1994)
A. Goscinski
Two algorithms for mutual exclusion in real-time distributed computing systems
J. Parallel Distrib. Comput.
(l990)
J. Helary et al.
A distributed algorithm for mutual exclusion in an arbitrary network
Comput. J.
(1988)
L. Lamport
Time, clocks and ordering of events in distributed systems
Comm. ACM
(July 1978)

There are more references available in the full text version of this article.

Cited by (8)

Token-based approach in distributed mutual exclusion algorithms: a review and direction to future research
2021, Journal of Supercomputing
An efficient asymmetric distributed lock for embedded multiprocessor systems
2012, Proceedings - 2012 International Conference on Embedded Computer Systems: Architectures, Modeling and Simulation, IC-SAMOS 2012
A distributed co-evolutionary particle Swarm Optimization Algorithm
2007, 2007 IEEE Congress on Evolutionary Computation, CEC 2007
A transparent distributed runtime for Java
2007, Handbook of Parallel Computing: Models, Algorithms and Applications
A software architecture for shared resource management in mobile ad hoc networks
2007, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Cluster based distributed mutual exclusion algorithms for mobile networks
2004, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

View all citing articles on Scopus

^f1: [email protected];[email protected]

¹: To whom correspondence should be addressed.

View full text

NoteAn Efficient Distributed Token-Based Mutual Exculsion Algorithm with Central Coordinator

Abstract

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput.

On mutual exclusion in computer networks

Comm. ACM

A token based k resilient mutual exclusion algorithm for distributed mutual exclusion

Inform. Process. Lett.

Two algorithms for mutual exclusion in real-time distributed computing systems

J. Parallel Distrib. Comput.

A distributed algorithm for mutual exclusion in an arbitrary network

Comput. J.

Time, clocks and ordering of events in distributed systems

Comm. ACM

Note
An Efficient Distributed Token-Based Mutual Exculsion Algorithm with Central Coordinator