This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Phase Synchronization on Asynchronous Uniform Rings with Odd Size
June 2001 (vol. 12 no. 6)
pp. 638-652

Abstract—This paper proposes a self-stabilizing phase synchronization protocol for uniform rings with an odd size. Nodes in the ring work asynchronously and proceed in a cyclic sequence of K phases, where K is even. The phase values of all the nodes are required to be no more than one apart. A system state which satisfies the requirement is therefore called a legitimate state. The proposed protocol guarantees that no matter with which initial state the system may start, the ring stabilizes eventually at a state after which the closure property on the legitimate state holds. Phase values should never go backward. The closure property on the legitimate states commonly used in previous works on self-stabilization cannot capture this requirement. This paper defines two terms, legitimate step and illegitimate step, to address this issue. An execution step that brings the ring from a legitimate state to another legitimate state in a way that the phase values of the nodes only advance is called a legitimate step. An execution step that observes the closure property on the legitimate states but makes some phase values go backward is modeled as an illegitimate step. It is shown that, for the proposed protocol, only a finite number of illegitimate steps are possible. After all possible illegitimate steps have occurred, the closure property on the legitimate steps holds.

[1] B. Awerbuch, S. Kutten, Y. Mansour, B. Patt-Shamir, and G. Varghese, “Time Optimal Self-Stabilizing Synchronization,” STOC '93 Proc. 25th Ann. ACM Symp. Theory of Computing, pp. 652-661, 1993.
[2] J.E. Burns and J. Pachl,“Uniform self-stabilizing rings,” ACM Trans. Programming Languages and Systems, vol. 11, no. 2, pp. 330-344, Apr. 1989,.
[3] J.M. Couvreur, N. Francez, and M.G. Gouda, “Asynchronous Unison,” Proc. 12th Int'l Conf. Distributed Computing Systems (ICDCS '92), pp. 486–493, 1992.
[4] E.W. Dijkstra,“Self-stabilizing systems in spite of distributed control,” Comm. ACM, vol. 17, no. 11 pp. 643-644, 1974,.
[5] E.W. Dijkstra, A Discipline of Programming.Englewood Cliffs, N.J.: Prentice Hall, 1976.
[6] M.G. Gouda and T. Herman, “Stabilizing Unison,” Information Processing Letters, vol. 35, pp. 171–175, 1990.
[7] T. Herman and S. Ghosh, “Stabilizing Phase-Clocks,” Information Processing Letters, vol. 54, pp. 259-265, 1995.
[8] S.T. Huang, “Leader Election in Uniform Rings,” ACM Trans. Programming Languages and Systems, vol. 15, pp. 563-573, 1993.
[9] S.T. Huang and T.J. Liu, “Four-State Stabilizing Phase Clock for Unidirectional Rings of Odd Size,” Information Processing Letters, vol. 65, pp. 325-329, 1998.
[10] S.S. Kulkarni and A. Arora, “Multitolerant Barrier Synchronization,” Information Processing Letters, vol. 64, pp. 29-36, 1997.
[11] S.S. Kulkarni and A. Arora, “Fine-Grain Multitolerant Barrier Synchronization,” Technical Report OSU-CISRC TR34, Ohio State Univ., 1997.
[12] L. Lamport, “Solved Problems, Unsolved Problems and Non-Problems in Concurrency,” PODC '84 Proc. Third Ann. ACM Symp. Principles of Distributed Computing, pp. 63-67, 1983.
[13] J. Misra, “Phase Synchronization,” Information Processing Letters, vol. 38, pp. 101-105, 1991.

Index Terms:
Distributed systems, fault tolerance, phase synchronization, self-stabilization, transient faults.
Citation:
Tzong-Jye Liu, Shing-Tsaan Huang, "Phase Synchronization on Asynchronous Uniform Rings with Odd Size," IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 6, pp. 638-652, June 2001, doi:10.1109/71.932717
Usage of this product signifies your acceptance of the Terms of Use.