By Topic

Universal self-stabilizing phase clock protocol with bounded memory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Nolot, F. ; Univ. de Picardie Jules Verne, Amiens, France ; Villain, V.

We propose a self-stabilizing K-phase clock protocol which works on uniform tree networks (i.e. without any root). The protocol is self-stabilizing because it guarantees that eventually all clock valve variables will be synchronized and advance in the same value, no matter what the initial state is. It requires (Degu+1)K states by processor u, where Degu is the degree of u; i.e., the number of neighbors that processor u has. The worst case stabilization time is D, where D is the diameter of the tree. This is the first universal protocol (i.e. working for any K), whose stabilization time does not depend on K. Moreover, it is the fastest of all the phase clock protocols with bounded memory

Published in:

Performance, Computing, and Communications, 2001. IEEE International Conference on.

Date of Conference:

Apr 2001