Asynchronous unison

Unbounded and bounded designs of asynchronous unison systems are discussed. It is shown that both systems are stabilizing in the sense that their steady state behaviors do not depend on their initial states. The systems can therefore tolerate memory and reconfiguration faults that may yield them in arbitrary states. It is also shown that unison systems are useful in designing multiphase systems.<<ETX>>

[1]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[2]  Nissim Francez,et al.  Decomposition of Distributed Programs into Communication-Closed Layers , 1982, Sci. Comput. Program..

[3]  Mohamed G. Gouda,et al.  Stabilizing Unison , 1990, Inf. Process. Lett..

[4]  B. Awerbuch,et al.  Distributed program checking: a paradigm for building self-stabilizing distributed protocols , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[5]  Anish Arora,et al.  Maintaining Digital Clocks In Step , 1991, WDAG.

[6]  Jayadev Misra,et al.  Phase Synchronization , 1991, Inf. Process. Lett..