Complexity of network synchronization
Journal of the ACM (JACM)
Uniform self-stabilizing rings
ACM Transactions on Programming Languages and Systems (TOPLAS)
Information Processing Letters
Information Processing Letters
Time optimal self-stabilizing synchronization
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Information Processing Letters
Four-state stabilizing phase clock for unidirectional rings of odd size
Information Processing Letters
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Phase Synchronization on Asynchronous Uniform Rings with Odd Size
IEEE Transactions on Parallel and Distributed Systems
Self-Stabilizing Neighborhood Synchronizer in Tree Networks
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Stabilization and pseudo-stabilization
Distributed Computing - Special issue: Self-stabilization
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock
IEEE Transactions on Dependable and Secure Computing
Self-stabilizing asynchronous phase synchronization in general graphs
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
| Hi-index | 0.01 |
Abstract--This paper proposes a self-stabilizing asynchronous phase synchronization protocol for uniform unidirectional rings. Consider applications with phase bound K, i.e., the phases are phase 0, phase 1, \ldots, phase K-1, phase 0, phase 1, etc. Under the protocol, when the ring is stabilized, it satisfies the following criterion: No node begins to execute phase (k+1)mod K until all nodes have executed phase k, and after all nodes have executed their phase k, each node eventually executes phase (k+1)mod K. Besides the variable used to denote the phase that a node is working on, each node maintains only one auxiliary variable with b states, where b can be any number greater than or equal to the ring size. Provided that K and b satisfy the limitation: {\rm{K}}\times bn(b-1), the proposed protocol is correct under the parallel model and takes at most 2({\rm{K}}\times b) rounds to stabilize.