Abstract
A local stabilizer protocol that takes any on-line or off-line distributed algorithm and converts it into a synchronous self-stabilizing algorithm with local monitoring and repairing properties is presented. Whenever the self-stabilizing version enters an inconsistent state, the inconsistency is detected, in O(1) time, and the system state is repaired in a local manner. The expected computation time that is lost during the repair process is proportional to the largest diameter of a faulty region.
Original language | English |
---|---|
Pages | 74-84 |
Number of pages | 11 |
State | Published - 1 Jan 1997 |
Externally published | Yes |
Event | Proceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS - Ramat-Gan, Isr Duration: 17 Jun 1997 → 19 Jun 1997 |
Conference
Conference | Proceedings of the 1997 5th Israel Symposium on Theory of Computing and Systems, ISTCS |
---|---|
City | Ramat-Gan, Isr |
Period | 17/06/97 → 19/06/97 |
ASJC Scopus subject areas
- General Computer Science