Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Safer Than Safe: On the Initial State of Self-stabilizing Systems
(Brief Announcement)
| |
|
Safer Than Safe: On the Initial State of Self-stabilizing Systems
(Brief Announcement)
Sylvie Delaët18  , Shlomi Dolev19 and Olivier Peres19
| (18) |
Univ Paris Sud, LRI, CNRS, Orsay, F-91405 |
| (19) |
Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel, 84105 |
Abstract
A self-stabilizing algorithm [2] is a distributed algorithm with an additional property: it guarantees to eventually execute
its task, by reaching a legitimate configuration, regardless of the state in which the processes and communication links are started.
Some algorithms are supposed to remain safe at all times while they carry out their task. Safety, however, is impossible when
very high levels of failures overwhelm the system, e.g., when more than a third of the processes are Byzantine, or in the
extreme case, when all the processes disappear.
A detailed version appears in a technical report [1].
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|