On Self-Stabilizing Wait-Free Clock Synchronization

Protocols which can tolerate any number of processors failing by ceasing operation for an unbounded number of steps and resuming operation (with or) without knowing that they were faulty are called wait-free if they also work correctly even when the starting state of the system is arbitrary, they are called wait-free, self-stabilizing. This work is on the problem of wait-free, self-stabilizing clock synchronization of n processors in an \in-phase" multiprocessor system and presents a protocol that achieves quadratic synchronization time, by \re-parameterizing" and improving the best previously known solution, which had cubic synchronization time. Both the protocol and its analysis are intuitive and easy to understand.

• Type: Conference
• Year: 1994
• Where: SWAT
• Authors: Marina Papatriantafilou, Philippas Tsigas
• Keywords: Algorithms, Quadratic Synchronization Time, Self-stabilizing Clock Synchronization, SWAT 1994, Synchronization Time