Self-Stabilizing l-Exclusion.
U Abraham, S Dolev, T Herman, I Koll:
Postscript Document and
DVI file.
Abstract
This work presents a self-stabilizing
algorithm for the problem of l-exclusion
using regular registers. The algorithm
is designed for weak communication primitives:
processes communicate using single-writer, multi-reader
regular registers. In addition to the consideration
of transient failures leading to an unpredictable
initial state, process crashes are also tolerated.
The algorithm is a combination of mechanisms
that are responsible for safety and fairness.
A preliminary version of this paper appears in
the proceedings of the third workshop on self-stabilizing
systems, 1997. This technical report is a major revision
of TR 97-03 of the Department of Mathematics and
Computer Science, Ben-Gurion University, Beer-Sheva, Israel.