Fair and Reliable Self-Stabilizing Communication - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Parallel Processing Letters Année : 2000

Fair and Reliable Self-Stabilizing Communication

Résumé

We assume a link-register communication model under read/write atomicity, where every process can read from but cannot write into its neighbours' registers. The paper presents two self-stabilizing protocols for basic fair and reliable link communication primitives. The rst primitive guarantees that any process writes a new value in its register(s) only after all its neighbours have read the previous value, whatever the initial scheduling of processes' actions. The second primitive implements a weak rendezvous communication mechanism by using an alternating bit protocol: whenever a process consecutively writes n values (possibly the same ones) in a register, each neighbour is guaranteed to read each value from the register at least once. Both protocols are self-stabilizing and run in asynchronous arbitrary networks. The goal of the paper is in handling each primitive by a separate procedure, which can be used as a black box in more involved self-stabilizing protocols.
Fichier principal
Vignette du fichier
ssfaircomm.pdf (150.78 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00465661 , version 1 (05-04-2010)
hal-00465661 , version 2 (06-12-2013)
hal-00465661 , version 3 (11-12-2013)

Identifiants

  • HAL Id : hal-00465661 , version 3

Citer

Colette Johnen, Ivan Lavallee, Christian Lavault. Fair and Reliable Self-Stabilizing Communication. Parallel Processing Letters, 2000, 10 (2), pp.51--59. ⟨hal-00465661v3⟩
278 Consultations
99 Téléchargements

Partager

Gmail Facebook X LinkedIn More