Toward a time-optimal odd phase clock unison in trees

Authors:
Christian Boulinier;Franck Petit;Vincent Villain
Affiliations:
LaRIA, CNRS, Université de Picardie Jules Verne, France;LaRIA, CNRS, Université de Picardie Jules Verne, France;LaRIA, CNRS, Université de Picardie Jules Verne, France
Venue:
SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems
Year:
2006

Citing 10
Cited 0

Stabilizing unison

Information Processing Letters
Phase synchronization

Information Processing Letters
Stabilizing phase-clocks

Information Processing Letters
Uniform Dynamic Self-Stabilizing Leader Election

IEEE Transactions on Parallel and Distributed Systems
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
When graph theory helps self-stabilization

Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Self-stabilizing atomicity refinement allowing neighborhood concurrency

SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Self-stabilizing publish/subscribe protocol for p2p networks

IWDC'05 Proceedings of the 7th international conference on 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

We address the self-stabilizing unison problem in tree networks. We propose two self-stabilizing unison protocols without any reset correcting system. The first one, called Protocol SU_Min, being scheduled by a synchronous daemon, is self-stabilizing to synchronous unison in at most D steps, where D is the diameter of the network. The second one, Protocol WU_Min, being scheduled by an asynchronous daemon, is self-stabilizing to asynchronous unison in at most D rounds. Moreover, both are optimal in space. The amount of required space is independent of any local or global information on the tree. Furthermore, they work on dynamic trees networks, in which the topology may change during the execution.