Local stabilizer

Yehuda Afek, Shlomi Dolev

Research output: Contribution to conferencePaperpeer-review

6 Scopus citations

Abstract

A local stabilizer algorithm that takes any on-line or offline distributed algorithm and converts it into a synchronous self-stabilizing algorithm, with local monitoring and repairing properties is presented. The expected computation time loss complexity measure is proposed to measure the average time in which the computation is paused in any node during recovery. In calculating the expected computational time loss, it is assumed that a transient fault changes the state of a processor to every possible state with equal probability.

Original languageEnglish
Pages287
Number of pages1
DOIs
StatePublished - 1 Jan 1997
Externally publishedYes
EventProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA
Duration: 21 Aug 199724 Aug 1997

Conference

ConferenceProceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing
CitySanta Barbara, CA, USA
Period21/08/9724/08/97

Fingerprint

Dive into the research topics of 'Local stabilizer'. Together they form a unique fingerprint.

Cite this