Actualités
  Période
semaine
ou mois
aucune période


  Thèmes:
Thèses
Colloques
Autres
Groupes
Tous les thèmes

   
  Liens:
Voir les thèses

Voir les colloques

Voir les autres événements

Voir la page des groupes

Accéder à l'intranet

Intitulé:   
Fault-tolerance Synchronous Handshake Algorithm for Local Computations
du groupe Algorithmique Distribuée

Date 2011-01-24  14:00-15:00
TitreFault-tolerance Synchronous Handshake Algorithm for Local Computations 
RésuméThis work presents a new probabilistic, synchronization algorithm to get a handshake between two neighboring nodes in the graph. This algorithm is designed for an asynchronous distributed network of anonymous processes which use the message exchange as a model for the communication. In this work, we use the Event-B method for the specification and for the proof of correctness. We present a comparative study between our algorithm and the one proposed by Y. Metivier et al. (*). We show that our proposal presents a considerable improvement of the previous one in terms of the number of sent messages and fault tolerance. We display the effectiveness of our algorithm by highlighting the importance of its asynchronous aspect on the total performances of the algorithm. (*) Metivier, Y., Saheb, N., Zemmari, A.: Randomized rendezvous. In: In Mathematics and computer science : Algorithms, trees, combinatorics and probabilities, Trends in mathematics. pp. 183-194. Birkhäuser (2000)  
LieuSalle 178 
OrateurMohamed Tounsi 
UrlLaBRI  



Aucun document lié à cet événement.

Retour
Retour à l'index