@inproceedings{2e2c22c9912d439f84d856c3870300e0,

title = "Self-stabilizing asynchronous phase synchronization in general graphs",

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 Δ + log K) bits, where Δ is the maximum degree of the system and K > 1 is the number of phases.",

keywords = "Distributed system, Fault tolerance, Phase synchronization, Self-stabilization, Spanning tree",

author = "Tzeng, {Chi Hung} and Jiang, {Jehn Ruey} and Huang, {Shing Tsaan}",

year = "2006",

doi = "10.1007/978-3-540-49823-0_35",

language = "???core.languages.en_GB???",

isbn = "3540490183",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "501--515",

booktitle = "Stabilization, Safety, and Security of Distributed Systems - 8th International Symposium, SSS 2006. Proceedings",

note = "null ; Conference date: 17-11-2006 Through 19-11-2006",

}