Abstract
We address the self-stabilizing unison problem in tree networks. We propose two self-stabilizing unison protocols without any reset correcting system. The first one, called Protocol SU_Min, being scheduled by a synchronous daemon, is self-stabilizing to synchronous unison in at most D steps, where D is the diameter of the network. The second one, Protocol WU_Min, being scheduled by an asynchronous daemon, is self-stabilizing to asynchronous unison in at most D rounds. Moreover, both are optimal in space. The amount of required space is independent of any local or global information on the tree. Furthermore, they work on dynamic trees networks, in which the topology may change during the execution.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Misra, J.: Phase synchronization. Information Processing Letters 38(2), 101–105 (1991)
Couvreur, J., Francez, N., Gouda, M.: Asynchronous unison. In: Proceedings of the 12th IEEE International Conference on Distributed Computing Systems (ICDCS 1992), pp. 486–493 (1992)
Boulinier, C., Petit, F., Villain, V.: When graph theory helps self-stabilization. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 150–159 (2004)
Cantarell, S., Datta, A., Petit, F.: Self-stabilizing atomicity refinement allowing neighborhood concurrency. In: Huang, S.-T., Herman, T. (eds.) SSS 2003. LNCS, vol. 2704, pp. 102–112. Springer, Heidelberg (2003)
Xu, Z., Srimani, P.: Self-stabilizing publish/subscribe protocol for P2P networks. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds.) IWDC 2005. LNCS, vol. 3741, pp. 129–140. Springer, Heidelberg (2005)
Dijkstra, E.: Self stabilizing systems in spite of distributed control. Communications of the Association of the Computing Machinery 17, 643–644 (1974)
Dolev, S.: Self-Stabilization. The MIT Press, Cambridge (2000)
Gouda, M., Herman, T.: Stabilizing unison. Information Processing Letters 35, 171–175 (1990)
Arora, A., Dolev, S., Gouda, M.: Maintaining digital clocks in step. Parallel Processing Letters 1, 11–18 (1991)
Herman, T., Ghosh, S.: Stabilizing phase-clocks. Information Processing Letters 54, 259–265 (1995)
Boulinier, C., Petit, F., Villain, V.: Synchronous vs. Asynchronous Unison. In: Tixeuil, S., Herman, T. (eds.) SSS 2005. LNCS, vol. 3764, pp. 18–32. Springer, Heidelberg (2005)
Nolot, F., Villain, V.: Universal self-stabilizing phase clock protocol with bounded memory. In: IPCCC 2001, 20th IEEE International Performance, Computing, and Communications Conference, pp. 228–235 (2001)
Dolev, S., Israeli, A., Moran, S.: Uniform dynamic self-stabilizing leader election. IEEE Transactions on Parallel and Distributed Systems 8(4), 424–440 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boulinier, C., Petit, F., Villain, V. (2006). Toward a Time-Optimal Odd Phase Clock Unison in Trees. In: Datta, A.K., Gradinariu, M. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2006. Lecture Notes in Computer Science, vol 4280. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-49823-0_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-49823-0_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49018-0
Online ISBN: 978-3-540-49823-0
eBook Packages: Computer ScienceComputer Science (R0)