Parallel composition for time-to-fault adaptive stabilization

Shlomi Dolev; Ted Herman

doi:10.1007/s00446-007-0028-y

Parallel composition for time-to-fault adaptive stabilization

Shlomi Dolev, Ted Herman

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

4 Scopus citations

Abstract

Self-stabilizing algorithms automatically recover from any occurrence of a transient fault. The global state following the transient fault is considered to be the initial state for subsequent execution. An adaptive self-stabilizing algorithm changes its behavior based on characteristics of the initial state. This paper presents an asynchronous, adaptive, self-stabilizing algorithm for any non-interactive task. The algorithm adapts its output stabilization time in relation to the extent of faulty information in the initial state. The paper's presentation emphasizes composition techniques that leverage several self-stabilizing components from previous research, resulting in a concise description of the algorithm.

Original language	English
Pages (from-to)	29-38
Number of pages	10
Journal	Distributed Computing
Volume	20
Issue number	1
DOIs	https://doi.org/10.1007/s00446-007-0028-y
State	Published - 1 Jul 2007

Keywords

Adaptive stabilization
Automatic recovery
Self-stabilization

ASJC Scopus subject areas

Theoretical Computer Science
Hardware and Architecture
Computer Networks and Communications
Computational Theory and Mathematics

Access to Document

10.1007/s00446-007-0028-y

Cite this

@article{0f8ba36ac8d64f588161f07a1a2a7484,

title = "Parallel composition for time-to-fault adaptive stabilization",

abstract = "Self-stabilizing algorithms automatically recover from any occurrence of a transient fault. The global state following the transient fault is considered to be the initial state for subsequent execution. An adaptive self-stabilizing algorithm changes its behavior based on characteristics of the initial state. This paper presents an asynchronous, adaptive, self-stabilizing algorithm for any non-interactive task. The algorithm adapts its output stabilization time in relation to the extent of faulty information in the initial state. The paper's presentation emphasizes composition techniques that leverage several self-stabilizing components from previous research, resulting in a concise description of the algorithm.",

keywords = "Adaptive stabilization, Automatic recovery, Self-stabilization",

author = "Shlomi Dolev and Ted Herman",

year = "2007",

month = jul,

day = "1",

doi = "10.1007/s00446-007-0028-y",

language = "English",

volume = "20",

pages = "29--38",

journal = "Distributed Computing",

issn = "0178-2770",

publisher = "Springer Verlag",

number = "1",

}

TY - JOUR

T1 - Parallel composition for time-to-fault adaptive stabilization

AU - Dolev, Shlomi

AU - Herman, Ted

PY - 2007/7/1

Y1 - 2007/7/1

N2 - Self-stabilizing algorithms automatically recover from any occurrence of a transient fault. The global state following the transient fault is considered to be the initial state for subsequent execution. An adaptive self-stabilizing algorithm changes its behavior based on characteristics of the initial state. This paper presents an asynchronous, adaptive, self-stabilizing algorithm for any non-interactive task. The algorithm adapts its output stabilization time in relation to the extent of faulty information in the initial state. The paper's presentation emphasizes composition techniques that leverage several self-stabilizing components from previous research, resulting in a concise description of the algorithm.

AB - Self-stabilizing algorithms automatically recover from any occurrence of a transient fault. The global state following the transient fault is considered to be the initial state for subsequent execution. An adaptive self-stabilizing algorithm changes its behavior based on characteristics of the initial state. This paper presents an asynchronous, adaptive, self-stabilizing algorithm for any non-interactive task. The algorithm adapts its output stabilization time in relation to the extent of faulty information in the initial state. The paper's presentation emphasizes composition techniques that leverage several self-stabilizing components from previous research, resulting in a concise description of the algorithm.

KW - Adaptive stabilization

KW - Automatic recovery

KW - Self-stabilization

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

U2 - 10.1007/s00446-007-0028-y

DO - 10.1007/s00446-007-0028-y

M3 - Article

AN - SCOPUS:34547222494

SN - 0178-2770

VL - 20

SP - 29

EP - 38

JO - Distributed Computing

JF - Distributed Computing

IS - 1

ER -

Parallel composition for time-to-fault adaptive stabilization

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this