A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity

Authors:
Tetz C. Huang;Ji-Cherng Lin;Nathan Mou
Affiliations:
-;-;-
Venue:
Computers & Mathematics with Applications
Year:
2004

Citing 4
Cited 3

A belated proof of self-stabilization

Distributed Computing
Self-Stabilizing Algorithms for Finding Centers and Medians of Trees

SIAM Journal on Computing
Self-stabilizing systems in spite of distributed control

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

Distributed Computing - Special issue: Self-stabilization

Short correctness proofs for two self-stabilizing algorithms under the distributed daemon model

Discrete Applied Mathematics
Quasi-self-stabilization of a distributed system assuming read/write atomicity

Computers & Mathematics with Applications
Correctness of Self-Stabilizing Algorithms Under the Dolev Model When Adapted to Composite Atomicity Models

International Journal of Artificial Life Research

Quantified Score

Hi-index	0.09

Visualization

Abstract

The problem of locating centers of graphs has a variety of applications in the areasof transportation and communication in distributed systems. In this paper, we design and prove the correctness of a self-stabilizing algorithm which finds the center(s) for a distributed system with a tree topology. The computational model employed in this paper was introduced by Dolev et al., which assumes the read/write separate atomicity.