A self-stabilizing ring orientation algorithm with a smaller number of processor states

Narutoshi Umemoto, Hirotsugu Kakugawa, Masafumi Yamashita

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)


A distributed system is said to be self-stabilizing if it will eventually reach a legitimate system state regardless of its initial state. Because of this property, a self-stabilizing system is extremely robust against failures; it tolerates any finite number of transient failures. The ring orientation problem for a ring is the problem of all the processors agreeing on a common ring direction. This paper focuses on the problem of designing a deterministic self-stabilizing ring orientation system with a small number of processor states under the distributed daemon. Because of the impossibility of symmetry breaking, under the distributed daemon, no such systems exist when the number n of processors is even. Provided that n is odd, the best known upper bound on the number of states is 256 in the link-register model, and eight in the state-reading model. We improve the bound down to 63 = 216 in the link-register model.

Original languageEnglish
Pages (from-to)579-584
Number of pages6
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number6
Publication statusPublished - 1998

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'A self-stabilizing ring orientation algorithm with a smaller number of processor states'. Together they form a unique fingerprint.

Cite this