Self-stabilization (in spite of distributed control) in tree-structured systems

Kruijer, H. S. M.

doi:10.1016/0020-0190(79)90151-0

Cited by 72 publications

(20 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Therefore, this protocol is a self-stabilizing, mutual-exclusion protocol in the strongest possible sense: There is a unique legitimate sequence of configurations, which is a suffix of every possible execution of the protocol. In a way, this protocol is well known and is a simplified version of protocols presented in [3,4,11,13].…”

Section: The Basic Protocolmentioning

confidence: 97%

“…Burns and Pachl in [2] present a uniform, self-stabilizing, mutual-exclusion protocol for rings with a prime numer of processors. A semiuniform, self-stabilizing protocol for some variant of the mutual-exclusion problem which runs on tree systems is presented by Kruijer in [11]. A self-stabilizing, mutualexclusion protocol for systems with arbitrary communication graphs is presented by Tchuente in [16].…”

mentioning

confidence: 99%

See 1 more Smart Citation

Self-stabilization of dynamic systems assuming only read/write atomicity

1993

View full text Add to dashboard Cite

show abstract

Section: The Basic Protocolmentioning

confidence: 97%

mentioning

confidence: 99%

Self-stabilization of dynamic systems assuming only read/write atomicity

1993

View full text Add to dashboard Cite

show abstract

“…ception of [Kru79]. It took almost another decade before there was sufficient material 1 to warrant the survey by [Sch93].…”

Section: -2mentioning

confidence: 99%

Untitled

Hoover¹,

Rudnicki²

1996

Chicago J. of Theoretical Comp. Sci.

View full text Add to dashboard Cite

“…Dijkstra [6,7], and Burns and Pachl [4] dealt with token circulation on ring networks; Brown et al [2], on linear array of processors; Kruijer [11 ], on tree networks. The proposed protocol however works on general networks.…”

Section: Introductionmentioning

confidence: 99%

Self-stabilizing depth-first token circulation on networks

Huang

Chen

1993

Distrib Comput

View full text Add to dashboard Cite

Summary. This paper proposes a self-stabilizing protocol which circulates a token on a connected network in nondeterministic depth-first-search order, rooted at a special node. Starting with any initial state in which the network m a y have no token at all or more than one token, the protocol eventually makes the system stabilize in states * This research is supported by National Science Council of the Republic of China under the contract NSC81-0408-E-007-05 and NSC 82-0408-E-007-027 Correspondence to: S.-T. Huang having exactly one circulating token. With a slight modification to the protocol -by removing nondeterminism in the search -a depth-first-search tree on the n e t w o r k can be constructed. The proposed protocol runs on systems that allow parallel operations.

show abstract

Self-stabilization (in spite of distributed control) in tree-structured systems

Cited by 72 publications

References 1 publication

Self-stabilization of dynamic systems assuming only read/write atomicity

Self-stabilization of dynamic systems assuming only read/write atomicity

Untitled

Self-stabilizing depth-first token circulation on networks

Contact Info

Product

Resources

About