A randomized 1-latent, time-adaptive and safe self-stabilizing mutual exclusion protocol

Jun Kiniwa, Masafumi Yamashita

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

For bidirectional rings, there have been proposed self-stabilizing mutual exclusion protocols, which are either time-adaptive (i.e., efficient in recovery) or 1-latent (i.e., efficient in legal execution) but not both. This paper proposes a randomized self-stabilizing mutual exclusion protocol that inherits both of the advantages from them: It is 1-latent in the sense that the privilege is circulated in a linear round (i.e., very intuitively, the privilege is transferred from a process to another by a "step"), provided that the system always stays in legitimate configurations, and is weakly time-adaptive in the sense that the system stabilizes from any configuration c in O(f) steps with a high probability, where f is the number of corrupted processes in c. It also guarantees with a high probability that there is at most one privilege even while converging to a legitimate configuration.

Original languageEnglish
Pages (from-to)53-61
Number of pages9
JournalParallel Processing Letters
Volume16
Issue number1
DOIs
Publication statusPublished - Mar 1 2006

Fingerprint

Mutual Exclusion
Configuration
Recovery
Ring

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Software
  • Hardware and Architecture

Cite this

A randomized 1-latent, time-adaptive and safe self-stabilizing mutual exclusion protocol. / Kiniwa, Jun; Yamashita, Masafumi.

In: Parallel Processing Letters, Vol. 16, No. 1, 01.03.2006, p. 53-61.

Research output: Contribution to journalArticle

Kiniwa, Jun ; Yamashita, Masafumi. / A randomized 1-latent, time-adaptive and safe self-stabilizing mutual exclusion protocol. In: Parallel Processing Letters. 2006 ; Vol. 16, No. 1. pp. 53-61.
@article{961c50e5295d42ec9946eccf996e22b9,
title = "A randomized 1-latent, time-adaptive and safe self-stabilizing mutual exclusion protocol",
abstract = "For bidirectional rings, there have been proposed self-stabilizing mutual exclusion protocols, which are either time-adaptive (i.e., efficient in recovery) or 1-latent (i.e., efficient in legal execution) but not both. This paper proposes a randomized self-stabilizing mutual exclusion protocol that inherits both of the advantages from them: It is 1-latent in the sense that the privilege is circulated in a linear round (i.e., very intuitively, the privilege is transferred from a process to another by a {"}step{"}), provided that the system always stays in legitimate configurations, and is weakly time-adaptive in the sense that the system stabilizes from any configuration c in O(f) steps with a high probability, where f is the number of corrupted processes in c. It also guarantees with a high probability that there is at most one privilege even while converging to a legitimate configuration.",
author = "Jun Kiniwa and Masafumi Yamashita",
year = "2006",
month = "3",
day = "1",
doi = "10.1142/S0129626406002460",
language = "English",
volume = "16",
pages = "53--61",
journal = "Parallel Processing Letters",
issn = "0129-6264",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "1",

}

TY - JOUR

T1 - A randomized 1-latent, time-adaptive and safe self-stabilizing mutual exclusion protocol

AU - Kiniwa, Jun

AU - Yamashita, Masafumi

PY - 2006/3/1

Y1 - 2006/3/1

N2 - For bidirectional rings, there have been proposed self-stabilizing mutual exclusion protocols, which are either time-adaptive (i.e., efficient in recovery) or 1-latent (i.e., efficient in legal execution) but not both. This paper proposes a randomized self-stabilizing mutual exclusion protocol that inherits both of the advantages from them: It is 1-latent in the sense that the privilege is circulated in a linear round (i.e., very intuitively, the privilege is transferred from a process to another by a "step"), provided that the system always stays in legitimate configurations, and is weakly time-adaptive in the sense that the system stabilizes from any configuration c in O(f) steps with a high probability, where f is the number of corrupted processes in c. It also guarantees with a high probability that there is at most one privilege even while converging to a legitimate configuration.

AB - For bidirectional rings, there have been proposed self-stabilizing mutual exclusion protocols, which are either time-adaptive (i.e., efficient in recovery) or 1-latent (i.e., efficient in legal execution) but not both. This paper proposes a randomized self-stabilizing mutual exclusion protocol that inherits both of the advantages from them: It is 1-latent in the sense that the privilege is circulated in a linear round (i.e., very intuitively, the privilege is transferred from a process to another by a "step"), provided that the system always stays in legitimate configurations, and is weakly time-adaptive in the sense that the system stabilizes from any configuration c in O(f) steps with a high probability, where f is the number of corrupted processes in c. It also guarantees with a high probability that there is at most one privilege even while converging to a legitimate configuration.

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

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

U2 - 10.1142/S0129626406002460

DO - 10.1142/S0129626406002460

M3 - Article

AN - SCOPUS:33644927451

VL - 16

SP - 53

EP - 61

JO - Parallel Processing Letters

JF - Parallel Processing Letters

SN - 0129-6264

IS - 1

ER -