A Fault-Tolerant Token-Based Mutual Exclusion Algorithm Using a Dynamic Tree

  • Julien Sopena
  • Luciana Arantes
  • Marin Bertier
  • Pierre Sens
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3648)


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.


Critical Section Original Algorithm Mutual Exclusion Node Failure Faulty Node 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bertier, M., Arantes, L., Sens, P.: Hierarchical token based mutual exclusion algorithms. In: 4th IEEE/ACM CCGrid 2004 (April 10, 2004)Google Scholar
  2. 2.
    Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Communications of the ACM 21(7), 558–564 (1978)zbMATHCrossRefGoogle Scholar
  3. 3.
    Maekawa, M.: A √N algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2), 145–159 (1985)CrossRefGoogle Scholar
  4. 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
  5. 5.
    Naimi, M., Trehel, M., Arnold, A.: A log (N) distributed mutual exclusion algorithm based on path reversal. Journal of Parallel and Distributed Computing 34(1), 1–13 (1996)CrossRefGoogle Scholar
  6. 6.
    Naimi, M., Trehel, M.: How to detect a failure and regenerate the token in the log(n) distributed algorithm for mutual exclusion. In: van Leeuwen, J. (ed.) WDAG 1987. LNCS, vol. 312, pp. 155–166. Springer, Heidelberg (1988)CrossRefGoogle Scholar
  7. 7.
    Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems (TOCS) 7(1), 61–77 (1989)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Ricart, G., Agrawala, A.: An optimal algorithm for mutual exclusion in computer networks. CACM: Communications of the ACM 24 (1981)Google Scholar
  9. 9.
    Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems (TOCS) 3(4), 344–349 (1985)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Julien Sopena
    • 1
  • Luciana Arantes
    • 1
  • Marin Bertier
    • 2
  • Pierre Sens
    • 1
  1. 1.INRIA, CNRSLIP6 – Université Paris 6 
  2. 2.CNRSLRI Université Paris 11 

Personalised recommendations