Self-stabilizing $2^m$ -clock for unidirectional rings of odd size

Huang, Shing-Tsaan; Liu, Tzong-Jye

doi:10.1007/s004460050054

Cited by 8 publications

(6 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge, self-stabilization for dynamic problems have never been addressed in wide classes of directed networks. Only token circulation [Dij74], clock synchronization [HL99], and mutual exclusion [KY02] have been considered in the restricted case of unidirectional rings.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

On Self-stabilizing Leader Election in Directed Networks

Altisen,

Cournier,

Defalque

et al. 2024

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

“…To the best of our knowledge, self-stabilizing synchronous unison in directed networks has been only considered in [HL99,ACDD23]. [HL99] focuses on the restricted case of unidirectional rings of odd size.…”

Section: Related Workmentioning

confidence: 99%

On Self-stabilizing Leader Election in Directed Networks

Altisen,

Cournier,

Defalque

et al. 2024

Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing

View full text Add to dashboard Cite

“…That is, we need a uniform three-clock phase synchronization algorithm and a three-color coloring algorithm to achieve the optimality and 1-fairness properties. For the synchronization part, most of the related papers focus on binary clock [10], or clock value bounded by a function of the network topology [1,11]. One algorithm proposed by [11] can solve the synchronization for three-clock phases, but only works for acyclic networks.…”

Section: Introductionmentioning

confidence: 99%

Alternators on uniform rings of odd size

Huang

Hung

2003

Distributed Computing

Self Cite

View full text Add to dashboard Cite

An alternator is a network of concurrent processes, which satisfies the following conditions. (1) If one process executes the critical step, no neighbor of the process executes the critical step in the same computing step.(2) Along any infinite computing steps, each process executes the critical step infinitely often. (3)An alternator is self-stabilizing to the above conditions. An alternator is said to be 1-fair if condition (2) is changed as: A process can execute the critical step twice only if all other processes execute the critical step at least once. In this paper, we proposed an alternator for rings of odd size. The design has the snap property in the sense that it satisfies condition (1) even when transient faults occur. The alternator allows each process execute the critical step once every three steps when it stabilizes. The design is optimal 1-fair in the sense that no other 1-fair design can have better performance. Based on the above design, we fine-tune the alternator to achieve maximal performance. That is, our final alternator is a maximal alternator: a process is allowed to execute the critical step when both its two neighbors do not execute the critical step.

show abstract

“…This notion of legal configuration gives rise to the following simple synchronization rule, which is implicit in the α synchronizer of [5]. (We note that self-stabilization is not a concern in [5]; however, similar rules are used in papers that did ensure self-stabilization [12,32,31,18,35]. )…”

Section: Requirements and Examplesmentioning

confidence: 99%

“…[40,34,35]. In [12] a bounded value self-stabilizing algorithm for synchronous networks is presented.…”

Section: Introductionmentioning

confidence: 99%

A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock

Awerbuch

Kutten

Mansour

et al. 2007

IEEE Trans. Dependable and Secure Comput.

View full text Add to dashboard Cite

A synchronizer with a phase counter (sometimes called asynchronous phase clock) is an asynchronous distributed algorithm, where each node maintains a local 'pulse counter' that simulates the global clock in a synchronous network. In this paper we present a time optimal self-stabilizing scheme for such a synchronizer, assuming unbounded counters. We give a simple rule by which each node can compute its pulse number as a function of its neighbors' pulse numbers. We also show that some of the popular correction functions for phase clock synchronization are not self-stabilizing in asynchronous networks. Using our rule, the counters stabilize in time bounded by the diameter of the network, without invoking global operations. We argue that the use of unbounded counters can be justified by the availability of memory for counters that are large enough to be practically unbounded, and by the existence of reset protocols that can be used to restart the counters in some rare cases where faults will make this necessary.

show abstract

Self-stabilizing $2^m$ -clock for unidirectional rings of odd size

Cited by 8 publications

References 10 publications

On Self-stabilizing Leader Election in Directed Networks

On Self-stabilizing Leader Election in Directed Networks

Alternators on uniform rings of odd size

A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock

Contact Info

Product

Resources

About