Self-stabilizing asynchronous phase synchronization in general graphs

Authors:
Chi-Hung Tzeng;Jehn-Ruey Jiang;Shing-Tsaan Huang
Affiliations:
National Tsing Hua University, Hsinchu, Taiwan;National Central University, Chungli, Taiwan;National Central University, Chungli, Taiwan
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 11
Cited 0

Stabilizing unison

Information Processing Letters
Time optimal self-stabilizing synchronization

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Possible and Impossible Self-Stabilizing Digital ClockSynchronization in General Graphs

Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part I
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
Distributed Reset

IEEE Transactions on Computers
The alternator

ICDCS '99 Workshop on Self-stabilizing Systems
Self-Stabilization with Global Rooted Synchronizers

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Asynchronous Phase Synchronization in Uniform Unidirectional Rings

IEEE Transactions on Parallel and Distributed Systems
Self-stabilizing 2m-clock for unidirectional rings of odd size

Distributed Computing
Synchronous vs. asynchronous unison

SSS'05 Proceedings of the 7th international conference on Self-Stabilizing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The phase synchronization problem requires each node to infinitely transfer from one phase to the next one under the restriction that at most two consecutive phases can appear among all nodes. In this paper, we propose a self-stabilizing algorithm under the parallel execution model to solve this problem for semi-uniform systems of general graph topologies. The proposed algorithm is memory-efficient; its space complexity per node is O(logΔ + logK) bits, where Δ is the maximum degree of the system and K 1 is the number of phases.