Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...

This paper presents a framework for token based mutual exclusion algorithms in distributed systems. Their exists some traditional token based mutual exclusion algorithm. Some new algorithms are proposed in order to increase fault tolerance, minimize message complexity and decrease synchronization delay. In this paper, some new approaches are used, like Token ring algorithm with centralized appr...

This paper presents a token based mutual exclusion algorithm which is k-resilient in that it can tolerate upto k site/link failures. The algorithm uses many features of the token based algorithm by Raymond 5] and inherits many of its advantages , viz. simplicity of the token message and the local data structure at each site. Correctness proofs of the algorithm and complexity analysis are included.

In this paper, a new hybrid algorithm that combines both token-based and character-based approaches is presented. The basic Levenshtein approach also has been extended to the token-based distance metric. The distance metric is enhanced to set the proper granularity level behavior of the algorithm. It smoothly maps a threshold of misspelling differences at the character level and the importance ...

Many atomic broadcast algorithms have been published in the last twenty years. Token-based algorithms represent a large class of these algorithms. Interestingly all the token-based atomic broadcast algorithms rely on a group membership service, i.e., none of them uses failure detectors. The paper presents the first token-based atomic broadcast algorithm that uses an unreliable failure detector ...

In token-based distributed mutual exclusion algorithms a unique object (token) is used to grant the right to enter the critical section. For the movement of the token within the computer network, two possible methods can be considered: perpetual mobility of the token and token-asking method. This paper presents a distributed token-based algorithm scheduling mutually exclusive access to a critic...

A mutual distributed algorithm on a token ring is proposed in this paper. The proposed algorithm is based on the token ring approach and allows simultaneous existence of several tokens in the logical ring of the network. Each process generates a unique token and sends it as request to enter the critical section that travels along the ring. The process can only enter the critical section if it g...