hide
Free keywords:
-
Abstract:
Past research on fault tolerant distributed systems has focussed on either
processor failures, ranging from benign crash failures to the malicious
byzantine failure types, or on transient memory failures, which can
suddenly corrupt the state of the system.
An interesting question in the theory of distributed computing is whether one
can device highly fault tolerant protocols which can
tolerate both processor failures as well as transient errors.
To answer this question we consider the construction of
self-stabilizing wait-free shared memory objects.
These objects occur naturally in distributed systems in which both processors
and memory may be faulty.
Our contribution in this paper is threefold. First, we propose a general
definition of a self-stabilizing wait-free shared memory object that
expresses safety guarantees even in the face of processor failures.
Second, we show that within this framework one cannot construct a
self-stabilizing single-reader single-writer regular bit from
single-reader single-writer safe bits. This result leads us to postulate a
self-stabilizing {\footnotesize\it dual\/}-reader single-writer safe bit with
which, as a
third contribution, we construct self-stabilizing regular and atomic registers.
