A fault-tolerant token-based mutual exclusion algorithm using a dynamic tree

Authors:
Julien Sopena;Luciana Arantes;Marin Bertier;Pierre Sens
Affiliations:
INRIA, CNRS, LIP6 – Université Paris 6;INRIA, CNRS, LIP6 – Université Paris 6;CNRS, LRI Université Paris;INRIA, CNRS, LIP6 – Université Paris 6
Venue:
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Year:
2005

Citing 9
Cited 2

A tree-based algorithm for distributed mutual exclusion

ACM Transactions on Computer Systems (TOCS)
A distributed mutual exclusion algorithm

ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems

ACM Transactions on Computer Systems (TOCS)
A log (N) distributed mutual exclusion algorithm based on path reversal

Journal of Parallel and Distributed Computing
An optimal algorithm for mutual exclusion in computer networks

Communications of the ACM
Time, clocks, and the ordering of events in a distributed system

Communications of the ACM
Fault-Tolerance for Token-based Synchronization Protocols

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
How to Detect a Failure and Regenerate the Token in the Log(N) Distributed Algorithm for Mutual Exclusion

Proceedings of the 2nd International Workshop on Distributed Algorithms
Hierarchical token based mutual exclusion algorithms

CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid

A priority-based distributed group mutual exclusion algorithm when group access is non-uniform

Journal of Parallel and Distributed Computing
Distributed priority inheritance for real-time and embedded systems

OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article presents a fault tolerant extension for the Naimi-Trehel token-based mutual exclusion algorithm. Contrary to the extension proposed by Naimi-Trehel, our approach minimizes the use of broadcast support by exploiting the distributed queue of token requests kept by the original algorithm. It also provides good fairness since, during failure recovery, it tries to preserve the order in which token requests would have been satisfied had the failure not occurred.