Possible and Impossible Self-Stabilizing Digital ClockSynchronization in General Graphs

  • Authors:
  • Shlomi Dolev

  • Affiliations:
  • Department of Mathematics and Computer Science, Ben-Gurion University, Beer-Sheva 84105, Israel/ dolev@cs.bgu.ac.il

  • Venue:
  • Real-Time Systems - Special issue on global time in large scale distributed real-time systems, part I
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

We study digitalclock synchronization for multiprocessor systems, where processorsare triggered by a common clock pulse and communicate with othersvia shared memory. A self-stabilizing digitalclock synchronization protocol for systems with a general communicationgraph is presented. The protocol can commence in an arbitrarynon-consistent system state and converges to a legitimate statein which the clocks are synchronized and incremented by one inevery subsequent pulse.To enhance the fault-toleranceof our protocol, we allow that during and following convergenceprocessors may stop operating. Crash failures may partition thecommunication graph into several connected components. Our protocolsynchronizes the clocks of the processors in every such connectedcomponent. For the case in which faulty processors can exhibitByzantine behavior, we prove that there is no digital clock synchronizationprotocol that tolerates even one single faulty processor.