A new token passing distributed mutual exclusion algorithm

Authors:
Affiliations:
Venue:
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Year:
1996

Citing 0
Cited 4

Developing and Refining an Adaptive Token-Passing Strategy

ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Fault tolerant and robust mutual exclusion protocol for synchronous distributed systems

ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Implementing distributed mutual exclusion on multithreaded environments: the alien-threads approach

ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
Decentralized path planning for multi-agent teams with complex constraints

Autonomous Robots

Quantified Score

Hi-index	0.00

Visualization

Abstract

Eliminating interference between concurrently executing activities through mutual exclusion is one of the most fundamental problems in computer systems. The problem of mutual exclusion in a distributed system is especially interesting owing to the lack of global knowledge in the presence of variable communication delays. In this paper, a new token-based distributed mutual exclusion algorithm is proposed. The algorithm incurs approximately three messages at high loads, irrespective of the number of nodes N in the system. At low loads, it requires approximately N messages. The paper also addresses failure recovery issues, such as token loss.