Self stabilization
S Dolev - Journal of Aerospace Computing, Information, and …, 2004 - arc.aiaa.org
AULT tolerance and reliability are important issues for flight vehicles such as aircraft, space-
shuttles, and satellites. A self-stabilizing system recovers automatically following …
shuttles, and satellites. A self-stabilizing system recovers automatically following …
[图书][B] Distributed systems: an algorithmic approach
S Ghosh - 2006 - taylorfrancis.com
Most applications in distributed computing center around a set of common subproblems.
Distributed Systems: An Algorithmic Approach presents the algorithmic issues and …
Distributed Systems: An Algorithmic Approach presents the algorithmic issues and …
[图书][B] Design and analysis of distributed algorithms
N Santoro - 2006 - books.google.com
This text is based on a simple and fully reactive computational model that allows for intuitive
comprehension and logical designs. The principles and techniques presented can be …
comprehension and logical designs. The principles and techniques presented can be …
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population
model. This is a variant of the standard population protocol model, in which finite-state …
model. This is a variant of the standard population protocol model, in which finite-state …
Self-stabilizing clock synchronization in the presence of byzantine faults
We initiate a study of bounded clock synchronization under a more severe fault model than
that proposed by Lamport and Melliar-Smith [1985]. Realistic aspects of the problem of …
that proposed by Lamport and Melliar-Smith [1985]. Realistic aspects of the problem of …
Fast space optimal leader election in population protocols
L Gasieniec, G Stachowiak - arXiv preprint arXiv:1704.07649, 2017 - arxiv.org
The model of population protocols refers to the growing in popularity theoretical framework
suitable for studying pairwise interactions within a large collection of simple …
suitable for studying pairwise interactions within a large collection of simple …
[PDF][PDF] Symmetry Breaking in Anonymous Networks: Characterizations.
We characterize exactly the cases in which it is possible to elect a leader in an anonymous
network of processors by a deterministic algorithm, and we show that for every network there …
network of processors by a deterministic algorithm, and we show that for every network there …
Local stabilizer
A local stabilizer protocol that takes any on-or off-line distributed algorithm and converts it
into a synchronous self-stabilizing algorithm with local monitoring and repairing properties is …
into a synchronous self-stabilizing algorithm with local monitoring and repairing properties is …
[PDF][PDF] Asynchronous unison
A unison system is one where each node has a clock variable that is assigned a value i-1
when and only when the clock variable of every neighboring node has the value i or i--1. In …
when and only when the clock variable of every neighboring node has the value i or i--1. In …
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population
model. This is a variant of the standard population protocol model—in which finite-state …
model. This is a variant of the standard population protocol model—in which finite-state …