TY - JOUR

T1 - A time-optimal self-stabilizing synchronizer using a phase clock

AU - Awerbuch, Baruch

AU - Kutten, Shay

AU - Mansour, Yishay

AU - Patt-Shamir, Boaz

AU - Varghese, George

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

KW - Algorithms

KW - Computer systems organization

KW - Computer-communication networks

KW - Discrete mathematics

KW - Distributed networks

KW - Graph theory

KW - Mathematics of computing

KW - Network architecture and design subjects

KW - Reliability

KW - Theory

UR - http://www.scopus.com/inward/record.url?scp=34547991045&partnerID=8YFLogxK

U2 - 10.1109/TDSC.2007.1007

DO - 10.1109/TDSC.2007.1007

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:34547991045

SN - 1545-5971

VL - 4

SP - 180

EP - 190

JO - IEEE Transactions on Dependable and Secure Computing

JF - IEEE Transactions on Dependable and Secure Computing

IS - 3

ER -