Uniform and self-stabilizing token rings allowing unfair daemon

Hirotsugu Kakugawa, Masafumi Yamashita

研究成果: Contribution to journalArticle査読

23 被引用数 (Scopus)


A distributed system consists of a set of processes and a set of communication links, each connecting a pair of processes. A distributed system is said to be self-stabilizing if it converges to a correct system state no matter which system state it starts with. A self-stabilizing system is considered to be an ideal fault tolerant system, since it tolerates any kind and any finite number of transient failures. In this paper, we investigate uniform randomized self-stabilizing mutual exclusion systems on unidirectional rings. As far as deterministic systems are concerned, it is well-known that there is no such system when the number n of processes (i.e., ring size) is composite, even if a fair central-daemon (c-daemon) is assumed. A fair daemon guarantees that every process will be selected for activation infinitely many times. As for randomized systems, regardless of the ring size, we can design a self-stabilizing system even for a distributed-daemon (d-daemon). However, every system proposed so far assumes a daemon to be fair, and effectively replies on this assumption. This paper tackles the problem of designing a self-stabilizing system, without assuming the fairness of a daemon. As a result, we present a randomized self-stabilizing mutual exclusion system for any size n (including composite size) of a unidirectional ring. The number of process states of the system is 2(n - 1).

ジャーナルIEEE Transactions on Parallel and Distributed Systems
出版ステータス出版済み - 1997

All Science Journal Classification (ASJC) codes

  • 信号処理
  • ハードウェアとアーキテクチャ
  • 計算理論と計算数学


「Uniform and self-stabilizing token rings allowing unfair daemon」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。