Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct

Hirotsugu Kakugawa, Masafumi Yamashita

Research output: Contribution to journalConference article

17 Citations (Scopus)

Abstract

A self-stabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have the same identifiers. Under the assumption that the process identifiers are chromatic, this paper proposes two self-stabilizing local mutual exclusion algorithms; one assumes a tree as the topology of communication network and requires 3 states per process, while the other, which works on any communication network, requires n + 1 states per process, where n is the number of processes in the system. We also show that the process identifiers being chromatic is close to necessary for a system to have a self-stabilizing local mutual exclusion algorithm. We adopt the shared memory model for communication and the unfair distributed daemon for process scheduling.

Original languageEnglish
Pages (from-to)202-211
Number of pages10
JournalProceedings of the IEEE Symposium on Reliable Distributed Systems
Publication statusPublished - Jan 1 2002
EventThe 21st IEEE Symposium on Reliable Distributed Systems (SRDS-2002) - Suita, Japan
Duration: Oct 13 2002Oct 16 2002

Fingerprint

Mutual Exclusion
Telecommunication networks
Distinct
Trees (mathematics)
Scheduling
Topology
Data storage equipment
Communication
Communication Networks
Unfair
Memory Model
Shared Memory
Converge
Necessary

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct. / Kakugawa, Hirotsugu; Yamashita, Masafumi.

In: Proceedings of the IEEE Symposium on Reliable Distributed Systems, 01.01.2002, p. 202-211.

Research output: Contribution to journalConference article

@article{8eab0bcc915e4d39a80de44f475aedf7,
title = "Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct",
abstract = "A self-stabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have the same identifiers. Under the assumption that the process identifiers are chromatic, this paper proposes two self-stabilizing local mutual exclusion algorithms; one assumes a tree as the topology of communication network and requires 3 states per process, while the other, which works on any communication network, requires n + 1 states per process, where n is the number of processes in the system. We also show that the process identifiers being chromatic is close to necessary for a system to have a self-stabilizing local mutual exclusion algorithm. We adopt the shared memory model for communication and the unfair distributed daemon for process scheduling.",
author = "Hirotsugu Kakugawa and Masafumi Yamashita",
year = "2002",
month = "1",
day = "1",
language = "English",
pages = "202--211",
journal = "Proceedings of the IEEE Symposium on Reliable Distributed Systems",
issn = "1060-9857",
publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - Self-stabilizing local mutual exclusion on networks in which process identifiers are not distinct

AU - Kakugawa, Hirotsugu

AU - Yamashita, Masafumi

PY - 2002/1/1

Y1 - 2002/1/1

N2 - A self-stabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have the same identifiers. Under the assumption that the process identifiers are chromatic, this paper proposes two self-stabilizing local mutual exclusion algorithms; one assumes a tree as the topology of communication network and requires 3 states per process, while the other, which works on any communication network, requires n + 1 states per process, where n is the number of processes in the system. We also show that the process identifiers being chromatic is close to necessary for a system to have a self-stabilizing local mutual exclusion algorithm. We adopt the shared memory model for communication and the unfair distributed daemon for process scheduling.

AB - A self-stabilizing system is a system such that it autonomously converges to a legitimate system state, regardless of the initial system state. The local mutual exclusion problem is the problem of guaranteeing that no two processes neighboring each other execute their critical sections at a time. The process identifiers are said to be chromatic if no two processes neighboring each other have the same identifiers. Under the assumption that the process identifiers are chromatic, this paper proposes two self-stabilizing local mutual exclusion algorithms; one assumes a tree as the topology of communication network and requires 3 states per process, while the other, which works on any communication network, requires n + 1 states per process, where n is the number of processes in the system. We also show that the process identifiers being chromatic is close to necessary for a system to have a self-stabilizing local mutual exclusion algorithm. We adopt the shared memory model for communication and the unfair distributed daemon for process scheduling.

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

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

M3 - Conference article

AN - SCOPUS:0036443139

SP - 202

EP - 211

JO - Proceedings of the IEEE Symposium on Reliable Distributed Systems

JF - Proceedings of the IEEE Symposium on Reliable Distributed Systems

SN - 1060-9857

ER -