Loading...
Please wait, while we are loading the content...
Similar Documents
Uniform self-stabilizing leader election part 2: general graph protocol (1995).
| Content Provider | CiteSeerX |
|---|---|
| Author | Dolev, Shlomi Israeli, Amos Moran, Shlomo |
| Abstract | A distributed system is self-stabilizing if it can be started in any possible global state. Once started the system regains its consistency by itself, without any kind of outside intervention. The self-stabilization property makes the system tolerant to faults in which processors crash and then recover spontaneously in an arbitrary state. When the intermediate period in between one recovery and the next crash is long enough, the system stabilizes. A distributed system is uniform if all processors with the same number of neighbors are identical. A distributed system is dynamic if it can tolerate addition or deletion of processors and links without reinitialization. In this work, we study uniform dynamic self-stabilizing protocols for leader election under read/write atomicity. Our protocols use randomization to break symmetry. We first introduce self-stabilizing protocols for synchronization. Then, using |
| File Format | |
| Publisher Date | 1995-01-01 |
| Access Restriction | Open |
| Subject Keyword | Distributed System Uniform Self-stabilizing Leader Election Part General Graph Protocol Next Crash Leader Election Self-stabilization Property Outside Intervention Arbitrary State Intermediate Period Uniform Dynamic Self-stabilizing Protocol Possible Global State Read Write Atomicity Processor Crash Self-stabilizing Protocol |
| Content Type | Text |
