Self-stabilizing asynchronous phase synchronization in general graphs

Chi Hung Tzeng, Jehn Ruey Jiang, Shing Tsaan Huang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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.

Original languageEnglish
Title of host publicationStabilization, Safety, and Security of Distributed Systems - 8th International Symposium, SSS 2006. Proceedings
PublisherSpringer Verlag
Pages501-515
Number of pages15
ISBN (Print)3540490183, 9783540490180
DOIs
StatePublished - 2006
Event8th International Symposium on Self-Stabilizing Systems, SSS 2006 - Dallas, TX, United States
Duration: 17 Nov 200619 Nov 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4280 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference8th International Symposium on Self-Stabilizing Systems, SSS 2006
Country/TerritoryUnited States
CityDallas, TX
Period17/11/0619/11/06

Keywords

  • Distributed system
  • Fault tolerance
  • Phase synchronization
  • Self-stabilization
  • Spanning tree

Fingerprint

Dive into the research topics of 'Self-stabilizing asynchronous phase synchronization in general graphs'. Together they form a unique fingerprint.

Cite this