How to detect a failure and regenerate the token in the Log(n) distributed algorithm for mutual exclusion

  • Naimi Mohamed
  • Trehel Michel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 312)


A new distributed algorithm for mutual exclusion has been proposed for creating mutual exclusion in a computer network. The nodes communicate only by messages and do not share memory. This algorithm does not require a logical clock, and supposes that nodes do not fail.

The average number of messages required is in the order of Log(n), where n is the number of nodes.

In this paper, the tools are presented for detecting the node failures, and the regeneration of the token is guaranteed by one node election.

Key words and phrases

Distributed algorithm mutual exclusion node failure node election fault-tolerance 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Arnold, M.P. Delest, S. Dulucq, "Complexité moyenne de l'algorithme d'exclusion mutuelle de NAIMI-TREHEL," Rapport de recherche No1 87-14 Université de Bordeaux 1, (1987).Google Scholar
  2. [2]
    H. Garcia-Molina, "Elections in a distributed computing system," IEEE Trans. On Com. Vol. C-31, (Jan. 1982), pp. 48–59.Google Scholar
  3. [3]
    L. Lamport, "Using time instead of timeout for fault-tolerant distributed systems," ACM TOPLAS, Vol. 6, No. 2, (April 1984), pp. 254–280.CrossRefGoogle Scholar
  4. [4]
    M. Naimi, "Une structure arborescente pour une classe d'algorithmes distribués d'exclusion mutuelle," Thèse de l'université de Besançon, 1987Google Scholar
  5. [5]
    M. Raynal, "Systèmes Répartis et Réseaux, concepts outils et algorithmes," Eyrolles 1987.Google Scholar
  6. [6]
    M. Trehel, M. Naimi, "Un algorithme distribué d'exclusion mutuelle en Log(n)," TSI Vol. 6, no 2, (1987), pp. 141–150.Google Scholar
  7. [7]
    M. Trehel, M. Naimi, "A distributed algorithm for mutual exclusion based on data structures and fault tolerance," IEEE Phoenix Conference on Computers and Communications. Phoenix, Arizona, (Feb. 1987), pp. 35–39.Google Scholar
  8. [8]
    M. Trehel "Propriétés des nombres harmoniques Hn liées à des transformations d'arborescences," Rapport de recherche L.I., Université de Besançon, (Sep. 1986).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Naimi Mohamed
    • 1
  • Trehel Michel
    • 1
  1. 1.Laboratoire d'InformatiqueBesançon cedexFrance

Personalised recommendations