Self-stabilization with Global Rooted Synchronizers - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1998

Self-stabilization with Global Rooted Synchronizers

Résumé

We propose a self-stabilizing synchronization technique, called the {\it Global Rooted Synchronization}, that synchronizes processors in a tree network. This synchronizer can be used as a compiler to convert a synchronous protocol $P$ for tree networks into a self-stabilizing version of $P$ for tree networks. The synchronizer requires only $O(1)$ memory (other than the memory needed to maintain the tree) at each node regardless of the size of the network, stabilizes in $O(h)$ time, where $h$ is the height of the tree, and does not invoke any global operations. Several applications of this technique are presented, such as the distributed clock synchronization and global calculus computation--each being efficient both in time and space complexity compared to the previous results.
Fichier principal
Vignette du fichier
final.pdf (269.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00631710 , version 1 (13-10-2011)

Identifiants

Citer

Luc Onana Alima, Joffroy Beauquier, Ajoy Datta, Sébastien Tixeuil. Self-stabilization with Global Rooted Synchronizers. IEEE International Conference on Distributed Computing Systems (ICDCS 98), May 1998, Amsterdam, Netherlands. pp.102-109, ⟨10.1109/ICDCS.1998.679492⟩. ⟨hal-00631710⟩
252 Consultations
131 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More