Journal ArticleDOI
Uniform self-stabilizing rings
James E. Burns,Jan K. Pachl +1 more
TLDR
It is shown, by presenting a protocol and proving its correctness, that there is a self-stabilizing system with no distinguished processor if the size of the ring is prime.Abstract:
A self-stabilizing system has the property that, no matter how it is perturbed, it eventually returns to a legitimate configuration. Dijkstra originally introduced the self-stabilization problem and gave several solutions for a ring of processors in his 1974 Communications of the ACM paper. His solutions use a distinguished processor in the ring, which effectively acts as a controlling element to drive the system toward stability. Dijkstra has observed that a distinguished processor is essential if the number of processors in the ring is composite. We show, by presenting a protocol and proving its correctness, that there is a self-stabilizing system with no distinguished processor if the size of the ring is prime. The basic protocol uses T (n2) states in each processor when n is the size of the ring. We modify the basic protocol to obtain one that uses T (n2/ln n) states.read more
Citations
More filters
Book
An Introduction to Distributed Algorithms
TL;DR: A senior undergraduate or graduate level computer science textbook on algorithm design for distributed computer systems.
Journal ArticleDOI
Self-stabilization of dynamic systems assuming only read/write atomicity
TL;DR: Three self-stabilizing protocols for distributed systems in the shared memory model are presented, one of which is a mutual-exclusion prootocol for tree structured systems and the other two are a spanning tree protocol for systems with any connected communication graph.
Proceedings ArticleDOI
Self-stabilization by local checking and correction
TL;DR: The first self-stabilizing end-to-end communication protocol and the most efficient known self-Stabilizing network reset protocol are introduced.
Journal ArticleDOI
Distributed reset
Anish Arora,Mohamed G. Gouda +1 more
TL;DR: A reset subsystem is designed that can be embedded in an arbitrary distributed system in order to allow the system processes to reset the system when necessary, and is very robust: it can tolerate fail-stop failures and repairs of processes and channels, even when a reset is in progress.
Journal ArticleDOI
Self-stabilization
TL;DR: Self-stabilization is defined, its significance in the context of fault tolerance, the important research themes that have arisen from it, and the relevant results are defined.
References
More filters
Journal ArticleDOI
Self-stabilizing systems in spite of distributed control
TL;DR: In this paper, the synchronization task between loosely coupled cyclic sequential processes is viewed as keeping the relation "the system is in a legitimate state" invariant, and each individual process step that could possibly cause violation of that relation is preceded by a test deciding whether the process in question is allowed to proceed or has to be delayed.
Proceedings ArticleDOI
Local and global properties in networks of processors (Extended Abstract)
TL;DR: This paper attempts to get at some of the fundamental properties of distributed computing by means of the following question: “How much does each processor in a network of processors need to know about its own identity, the identities of other processors, and the underlying connection network in order for the network to be able to carry out useful functions?
Book ChapterDOI
Self-Stabilization in Spite of Distributed Control
TL;DR: In this article, a systematic way for finding the algorithm ensuring some desired form of co-operation between a set of loosely coupled sequential processes can in general terms be described as follows: the relation "the system is in a legitimate state" is kept invariant.
Journal ArticleDOI
A belated proof of self-stabilization
TL;DR: I thought that in Dijkstra 1974, I had published three solutions, but later I learned that I had also published three problems, as the programs had been given without a demonstration of their correctness, so a partial remedy is offered here.
Journal ArticleDOI
Token systems that self-stabilize
TL;DR: A novel class of mutual exclusion systems, in which processes circulate one token, and each process enters its critical section when it receives the token, which is easier to implement as delay-insensitive circuits.