Fair circulation of a token

Satoshi Ikeda, Izumi Kubo, Norihiro Okumoto, Masafumi Yamashita

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

Suppose that a distributed system is modeled by an undirected graph G = (V, E), where V and E, respectively, are the sets of processes and communication links. Israeli and Jalfon [6] proposed a simple self-stabilizing mutual exclusion algorithm: A token is circulated among the processes (i.e., vertices) and a process can access the critical section only when it holds the token. In order to guarantee equal access change to all processes, the token circulation is desired to be fair in the sense that all processes have the same probability of holding the token. However, the Israeli-Jalfon token circulation scheme does not meet the requirement. This paper proposes a new scheme for making it fair. We evaluate the average of the longest waiting times in terms of the cover time and show an O(deg(G)n 2) upper bound on the cover time for our scheme, where n and deg(G) are the number of processes and the maximum degree of G, respectively. The same (tight) upper bound is known for the Israeli-Jalfon scheme.

Original languageEnglish
Pages (from-to)367-372
Number of pages6
JournalIEEE Transactions on Parallel and Distributed Systems
Volume13
Issue number4
DOIs
Publication statusPublished - Apr 1 2002

Fingerprint

Telecommunication links
Cover Time
Upper bound
Mutual Exclusion
Waiting Time
Maximum Degree
Undirected Graph
Distributed Systems
Evaluate
Requirements

All Science Journal Classification (ASJC) codes

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

Cite this

Ikeda, S., Kubo, I., Okumoto, N., & Yamashita, M. (2002). Fair circulation of a token. IEEE Transactions on Parallel and Distributed Systems, 13(4), 367-372. https://doi.org/10.1109/71.995817

Fair circulation of a token. / Ikeda, Satoshi; Kubo, Izumi; Okumoto, Norihiro; Yamashita, Masafumi.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 4, 01.04.2002, p. 367-372.

Research output: Contribution to journalArticle

Ikeda, S, Kubo, I, Okumoto, N & Yamashita, M 2002, 'Fair circulation of a token', IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 4, pp. 367-372. https://doi.org/10.1109/71.995817
Ikeda, Satoshi ; Kubo, Izumi ; Okumoto, Norihiro ; Yamashita, Masafumi. / Fair circulation of a token. In: IEEE Transactions on Parallel and Distributed Systems. 2002 ; Vol. 13, No. 4. pp. 367-372.
@article{f4b49efdb0c74808acb4b95ec5b34b04,
title = "Fair circulation of a token",
abstract = "Suppose that a distributed system is modeled by an undirected graph G = (V, E), where V and E, respectively, are the sets of processes and communication links. Israeli and Jalfon [6] proposed a simple self-stabilizing mutual exclusion algorithm: A token is circulated among the processes (i.e., vertices) and a process can access the critical section only when it holds the token. In order to guarantee equal access change to all processes, the token circulation is desired to be fair in the sense that all processes have the same probability of holding the token. However, the Israeli-Jalfon token circulation scheme does not meet the requirement. This paper proposes a new scheme for making it fair. We evaluate the average of the longest waiting times in terms of the cover time and show an O(deg(G)n 2) upper bound on the cover time for our scheme, where n and deg(G) are the number of processes and the maximum degree of G, respectively. The same (tight) upper bound is known for the Israeli-Jalfon scheme.",
author = "Satoshi Ikeda and Izumi Kubo and Norihiro Okumoto and Masafumi Yamashita",
year = "2002",
month = "4",
day = "1",
doi = "10.1109/71.995817",
language = "English",
volume = "13",
pages = "367--372",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "4",

}

TY - JOUR

T1 - Fair circulation of a token

AU - Ikeda, Satoshi

AU - Kubo, Izumi

AU - Okumoto, Norihiro

AU - Yamashita, Masafumi

PY - 2002/4/1

Y1 - 2002/4/1

N2 - Suppose that a distributed system is modeled by an undirected graph G = (V, E), where V and E, respectively, are the sets of processes and communication links. Israeli and Jalfon [6] proposed a simple self-stabilizing mutual exclusion algorithm: A token is circulated among the processes (i.e., vertices) and a process can access the critical section only when it holds the token. In order to guarantee equal access change to all processes, the token circulation is desired to be fair in the sense that all processes have the same probability of holding the token. However, the Israeli-Jalfon token circulation scheme does not meet the requirement. This paper proposes a new scheme for making it fair. We evaluate the average of the longest waiting times in terms of the cover time and show an O(deg(G)n 2) upper bound on the cover time for our scheme, where n and deg(G) are the number of processes and the maximum degree of G, respectively. The same (tight) upper bound is known for the Israeli-Jalfon scheme.

AB - Suppose that a distributed system is modeled by an undirected graph G = (V, E), where V and E, respectively, are the sets of processes and communication links. Israeli and Jalfon [6] proposed a simple self-stabilizing mutual exclusion algorithm: A token is circulated among the processes (i.e., vertices) and a process can access the critical section only when it holds the token. In order to guarantee equal access change to all processes, the token circulation is desired to be fair in the sense that all processes have the same probability of holding the token. However, the Israeli-Jalfon token circulation scheme does not meet the requirement. This paper proposes a new scheme for making it fair. We evaluate the average of the longest waiting times in terms of the cover time and show an O(deg(G)n 2) upper bound on the cover time for our scheme, where n and deg(G) are the number of processes and the maximum degree of G, respectively. The same (tight) upper bound is known for the Israeli-Jalfon scheme.

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

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

U2 - 10.1109/71.995817

DO - 10.1109/71.995817

M3 - Article

AN - SCOPUS:0036530296

VL - 13

SP - 367

EP - 372

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 4

ER -