Abstract
The phase synchronization problem requires each node to infinitely transfer from one phase to the next one under the restriction that at most two consecutive phases can appear among all nodes. In this paper, we propose a self-stabilizing algorithm under the parallel execution model to solve this problem for semi-uniform systems of general graph topologies. The proposed algorithm is memory-efficient; its space complexity per node is O(logΔ + logK) bits, where Δ is the maximum degree of the system and K > 1 is the number of phases.
This research was supported in part by the National Science Council of the Republic of China under the Contract NSC 92-2213-E-008-029.
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
Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Communications of the ACM 17(11), 643–644 (1974)
Kulkarni, S., Arora, A.: Multitolerant barrier synchronization. Information Processing Letters 64(1), 29–36 (1997)
Boulinier, C., Petit, F., Villain, V.: Synchronous vs. asynchronous unison. Self-Stabilizing Systems, 18–32 (2005)
Gouda, M.G., Haddix, F.F.: The alternator. In: WSS, pp. 48–53 (1999)
Awerbuch, B., Kutten, S., Mansour, Y., Patt-Shamir, B., Varghese, G.: Time optimal self-stabilizing synchronization. In: ACM Symposium on Theory of Computing, pp. 652–661 (1993)
Kulkarni, S., Arora, A.: Fine-grain multitolerant barrier synchronization. Technical report, Technical Report OSU-CISRC TR34, Ohio State University (1997)
Alima, L.O., Beauquier, J., Datta, A.K., Tixeuil, S.: Self-stabilization with global rooted synchronizers. In: Proceedings of the 18th International Conference on Distributed Computing Systems, pp. 102–109 (1998)
Huang, S.T., Liu, T.J.: Phase synchronization on asynchronous uniform rings with odd size. IEEE Transactions on Parallel and Distributed System 12(6), 638–652 (2001)
Huang, S.T., Liu, T.J., Hung, S.S.: Asynchronous phase synchronization in uniform unidirectional rings. IEEE Transactions on Parallel and Distributed System 15(4), 378–384 (2004)
Arora, A., Dolev, S., Gouda, M.G.: Maintaining digital clocks in step. Parallel Processing Letters 1, 11–18 (1991)
Dolev, S.: Possible and impossible self-stabilizing digital clock synchronization in general graphs. Real-Time Systems 12(1), 95–107 (1997)
Gouda, M.G., Herman, T.: Stabilizing unison. Information Processing Letters 35, 171–175 (1990)
Huang, S.T., Liu, T.J.: Self-stabilizing 2m-clock for unidirectional rings of odd size. Distributed Computing 12, 41–46 (1999)
Arora, A., Gouda, M.: Distributed reset. IEEE Transactions on Computers 43(9), 1026–1038 (1994)
Gärtner, F.C.: A Survey of Self-Stabilizing Spanning-Tree Construction Algorithms. Technical report, Swiss Federal Institution of Technology (2003)
Kruijer, H.S.M.: Self-stabilization (in spite of distributed control) in tree-structured systems. Information Processing Letters 8(2), 91–95 (1979)
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
Tzeng, CH., Jiang, JR., Huang, ST. (2006). Self-stabilizing Asynchronous Phase Synchronization in General Graphs. 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_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-49823-0_35
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)