Uniform and self-stabilizing token rings allowing unfair daemon

Hirotsugu Kakugawa, Masafumi Yamashita

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

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).

Original languageEnglish
Pages (from-to)154-163
Number of pages10
JournalIEEE Transactions on Parallel and Distributed Systems
Volume8
Issue number2
DOIs
Publication statusPublished - Dec 1 1997

Fingerprint

Composite materials
Telecommunication links
Chemical activation

All Science Journal Classification (ASJC) codes

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

Cite this

Uniform and self-stabilizing token rings allowing unfair daemon. / Kakugawa, Hirotsugu; Yamashita, Masafumi.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 8, No. 2, 01.12.1997, p. 154-163.

Research output: Contribution to journalArticle

Kakugawa, Hirotsugu ; Yamashita, Masafumi. / Uniform and self-stabilizing token rings allowing unfair daemon. In: IEEE Transactions on Parallel and Distributed Systems. 1997 ; Vol. 8, No. 2. pp. 154-163.
@article{6339162fd4f24cc0a812959f622479f3,
title = "Uniform and self-stabilizing token rings allowing unfair daemon",
abstract = "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).",
author = "Hirotsugu Kakugawa and Masafumi Yamashita",
year = "1997",
month = "12",
day = "1",
doi = "10.1109/71.577257",
language = "English",
volume = "8",
pages = "154--163",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "2",

}

TY - JOUR

T1 - Uniform and self-stabilizing token rings allowing unfair daemon

AU - Kakugawa, Hirotsugu

AU - Yamashita, Masafumi

PY - 1997/12/1

Y1 - 1997/12/1

N2 - 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).

AB - 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).

UR - http://www.scopus.com/inward/record.url?scp=0031077688&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031077688&partnerID=8YFLogxK

U2 - 10.1109/71.577257

DO - 10.1109/71.577257

M3 - Article

VL - 8

SP - 154

EP - 163

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 2

ER -