.png){kind=icon}
Return
A time-optimal self-stabilizing synchronizer using a phase clock
.png){kind=icon}
PRE
AI
DOI：10.1109/TDSC.2007.1007.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
computer systems organization
computer-communication networks
network architecture and design subjects
distributed networks
mathematics of computing
discrete mathematics
graph theory
algorithms
reliability
theory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.6K
Citations:
9.6K
Organization
No organization information available
Cited Papers
Low-Threshold-Voltage and Electrically Switchable Polarization-Selective Scattering Mode Liquid Crystal Light Shutters.png)
Polymers
OAAI
PolymersIF0
OAAIShareSaveShareSaveShareSaveShareSave
ShareSave
View more