A Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree
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.
KeywordsCritical Section Original Algorithm Mutual Exclusion Node Failure Faulty Node
Unable to display preview. Download preview PDF.
- 1.Bertier, M., Arantes, L., Sens, P.: Hierarchical token based mutual exclusion algorithms. In: 4th IEEE/ACM CCGrid 2004 (April 10, 2004)Google Scholar
- 4.Mueller, F.: Fault tolerance for token-based synchronization protocols. In: Workshop on Fault-Tolerant Parallel and Distributed Systems, April 2001, IEEE, Los Alamitos (2001)Google Scholar
- 8.Ricart, G., Agrawala, A.: An optimal algorithm for mutual exclusion in computer networks. CACM: Communications of the ACM 24 (1981)Google Scholar