The goal of the paper is to provide designers of self-stabilizing protocols with a fair and reliable communication primitive, which allows any proces that writes a value in its own register to make sure that every neihgbour eventually does read that value. We assume a link register communication model under read/write atomicity, where every process can read but cannot write into its neighbours' registers. The primitive runs a self-stabilizing protocol, which implements a "rendezvous" communication mechanism in the link register asynchronous model. This protocol works in arbitrary networks and also solves the problem of how to simulate reliable self-stabilizing message-passing in asynchronous distributed systems.
Publié le : 1998-07-05
Classification:
Self-stabilizing,
Communication primitive,
Read/Write atomicity,
Rendezvous,
[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO],
[INFO.INFO-DC]Computer Science [cs]/Distributed, Parallel, and Cluster Computing [cs.DC]
@article{hal-00465672,
author = {Johnen, Colette and Lavallee, Ivan and Lavault, Christian},
title = {A Self-Stabilizing Communication Primitive},
journal = {HAL},
volume = {1998},
number = {0},
year = {1998},
language = {en},
url = {http://dml.mathdoc.fr/item/hal-00465672}
}
Johnen, Colette; Lavallee, Ivan; Lavault, Christian. A Self-Stabilizing Communication Primitive. HAL, Tome 1998 (1998) no. 0, . http://gdmltest.u-ga.fr/item/hal-00465672/