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. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Tzeng, C. H., Jiang, J. R., & Huang, S. T. (2006). Self-stabilizing asynchronous phase synchronization in general graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4280 LNCS, pp. 501–515). Springer Verlag. https://doi.org/10.1007/978-3-540-49823-0_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
