A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network Topologies

doi:10.1006/jpdc.1996.0078

Journal of Parallel and Distributed Computing

Volume 35, Issue 2, 15 June 1996, Pages 156-172

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

Abstract

We present a simple and efficient mutual exclusion algorithm whose optimal message passing complexity isO(N), whereNis the number of processors in the network. The message complexity is measured by counting the number of communication hops in a network for a given topology. 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. Moreover, this algorithm shortens the request delay by fully taking advantage of the network dynamic status information. The performance of the algorithm is also modeled for analytical evaluation. We have conducted a group of experiments on a network of workstations for comparisons 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 access the critical region in a distributed system. Finally, the token-chasing algorithm is further enhanced for fault tolerance under message loss and link crash conditions.

References (0)

Cited by (11)

A survey of permission-based distributed mutual exclusion algorithms
2003, Computer Standards and Interfaces
The problem of mutual exclusion in distributed systems has attracted considerable attention over the last two decades. The mutual exclusion problem requires that, at a time, only one of the contending processes be allowed to enter its critical section (CS). A number of solutions have been provided to the mutual exclusion problem in distributed systems. Different algorithms have used different techniques to achieve mutual exclusion and have different performances. Depending on the technique used, these algorithms have been classified as token-based and permission-based algorithms. In this paper, we present a survey of various permission-based distributed mutual exclusion (PBDME) algorithms and their comparative performance.
A token-based delay optimal algorithm for mutual exclusion in distributed systems
1999, Computer Standards and Interfaces
In this paper, we present a token-based mutual exclusion algorithm for arbitrary topologies. This algorithm makes use of the network topology and site information held by each node to achieve an optimal performance. It reduces the delay in accessing the CS by allowing the token to service the requesting site which fall on-route its destination. This technique reduces the delay to a considerable extent specially at high loads. Moreover, in this algorithm, special messages called token location propagators are used to disseminate token's information faster and wider in the network. The performance of the proposed algorithm is evaluated and compared with Helary et al.'s algorithm [J. Helary, N. Plozeau, M. Raynal, A distributed algorithm for mutual exclusion in an arbitrary network, Computer Journal, 31 (4) 289–295, August 1988.] and Yan et al.'s algorithm [Y. Yan, X. Zhang, H. Yang, A fast token chasing mutual exclusion algorithm in arbitrary network topologies, Journal of Parallel and Distributed Computing 35 (1996) 156–172.]. The effect of increasing the connectivity of the network topology on the performance was also studied. The experimental results show that the proposed algorithm has the best performance specially at high loads and on topologies with low connectivity.
A performance comparison of token- and tree-based mutual exclusion algorithms on Chordal Rings
1998, Journal of Network and Computer Applications
In this paper we present a performance comparison of token- and tree-based mutual exclusion algorithms. The effect of increasing the connectivity of the network topology on the performance of Raymond's algorithm, Changet al.'s algorithm, Helaryet al.'s algorithm, and Naimiet al.'s algorithm is studied. We find that Raymond's algorithm, which uses a static logical structure-based approach, has better performance than the rest of the above-mentioned algorithms, which are dynamic logical structure-based. When the network topology is near complete, the dynamic logical structure-based algorithms have a better response time than Raymond's algorithm. At higher loads, Raymond's algorithm has very low message traffic.
Token-based approach in distributed mutual exclusion algorithms: a review and direction to future research
2021, Journal of Supercomputing
An improved token-based distributed mutual exclusion algorithm
2019, International Journal of Engineering and Advanced Technology
A new robust centralized DMX algorithm
2007, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Systems

View all citing articles on Scopus

^☆: This work is supported in part by the National Science Foundation under Grants CCR-9102854 and CCR-9400719, by the Air Force Office of Scientific Research under Grant AFOSR-95-1-0215, and by the Office of Naval Research under Grant ONR-95-1-1239.

^☆☆: E-mail: [email protected], [email protected].

²: E-mail: [email protected], [email protected].

View full text

Regular ArticleA Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network Topologies☆,☆☆

Abstract

Regular Article
A Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network Topologies☆,☆☆