Local stabilizer

Yehuda Afek; Shlomi Dolev

doi:10.1145/259380.259505

Local stabilizer

Yehuda Afek, Shlomi Dolev

Research output: Contribution to conference › Paper › peer-review

9 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 language	English
Pages	287
Number of pages	1
DOIs	https://doi.org/10.1145/259380.259505
State	Published - 1 Jan 1997
Externally published	Yes
Event	Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing - Santa Barbara, CA, USA Duration: 21 Aug 1997 → 24 Aug 1997

Conference

Conference	Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing
City	Santa Barbara, CA, USA
Period	21/08/97 → 24/08/97

ASJC Scopus subject areas

Software
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1145/259380.259505

Cite this

@conference{0be9045ea5ff448c9493e9f0523184b8,

title = "Local stabilizer",

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.",

author = "Yehuda Afek and Shlomi Dolev",

note = "Funding Information: 1An extended abstract of this paper appeared in the Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, June 1997 and a brief announcement in Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, August 1997. 2To whom correspondence should be addressed. 3Partially supported by Israeli Ministry of Science and Arts Grant 6756195.; Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing ; Conference date: 21-08-1997 Through 24-08-1997",

year = "1997",

month = jan,

day = "1",

doi = "10.1145/259380.259505",

language = "English",

pages = "287",

}

TY - CONF

T1 - Local stabilizer

AU - Afek, Yehuda

AU - Dolev, Shlomi

N1 - Funding Information: 1An extended abstract of this paper appeared in the Proceedings of the 5th Israeli Symposium on Theory of Computing and Systems, June 1997 and a brief announcement in Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, August 1997. 2To whom correspondence should be addressed. 3Partially supported by Israeli Ministry of Science and Arts Grant 6756195.

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030661481&partnerID=8YFLogxK

U2 - 10.1145/259380.259505

DO - 10.1145/259380.259505

M3 - Paper

AN - SCOPUS:0030661481

SP - 287

T2 - Proceedings of the 1997 16th Annual ACM Symposium on Principles of Distributed Computing

Y2 - 21 August 1997 through 24 August 1997

ER -

Local stabilizer

Abstract

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this