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.
Publié le : 2000-07-04
Classification:
Self-stabilization,
Communication primitive,
Rendezvous,
Read/Write atomicity,
liveliness,
[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO],
[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
@article{hal-00465661,
author = {Johnen, Colette and Lavallee, Ivan and Lavault, Christian},
title = {Fair and Reliable Self-Stabilizing Communication},
journal = {HAL},
volume = {2000},
number = {0},
year = {2000},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-00465661}
}
Johnen, Colette; Lavallee, Ivan; Lavault, Christian. Fair and Reliable Self-Stabilizing Communication. HAL, Tome 2000 (2000) no. 0, . http://gdmltest.u-ga.fr/item/hal-00465661/