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

Content Provider	IEEE Xplore Digital Library
Author	Kakugawa, H. Yamashita, M.
Copyright Year	2002
Description	Author affiliation: Hiroshima Univ., Japan (Kakugawa, H.)
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.
Sponsorship	IEEE Comput. Soc. Tech. Committee on Distributed Process. IEEE Comput. Soc. Tech. Committee on Fault-Tolerant Comput. IFIP WG 10.4 on Dependable Comput. & Fault Tolerance IEICE Dependable Comput. Tech. Group Graduate School of Inf. Sci. & Technol., Osaka Univ
Starting Page	202
Ending Page	211
File Size	647355
Page Count	10
File Format	PDF
ISBN	0769516599
ISSN	10609857
DOI	10.1109/RELDIS.2002.1180189
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-10-13
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Intelligent networks Network topology Communication networks Distributed algorithms Control systems Distributed computing Fault tolerance Resumes Message passing
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computer Networks and Communications Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Multi-Token Distributed Mutual Exclusion Algorithm

Fault tolerance of message delivery with cascading copies

A self-stabilizing algorithm for finding cliques in distributed systems

A Fault-Tolerant Mutual Exclusion Resource Reservation Protocol for Clustered Mobile Ad hoc Networks

Fault-Tolerant Consensus in Unknown and Anonymous Networks

Snap-stabilizing PIF algorithm in arbitrary networks

A Timer-Free Fault Tolerant K-Mutual Exclusion Algorithm

Self-stabilizing k-out-of-ℓ exclusion on tree networks.

Mutual exclusion in arbitrary networks when process identity numbers are not distinct

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

Similar Documents

Multi-Token Distributed Mutual Exclusion Algorithm

Fault tolerance of message delivery with cascading copies

A self-stabilizing algorithm for finding cliques in distributed systems

A Fault-Tolerant Mutual Exclusion Resource Reservation Protocol for Clustered Mobile Ad hoc Networks

Fault-Tolerant Consensus in Unknown and Anonymous Networks

Snap-stabilizing PIF algorithm in arbitrary networks

A Timer-Free Fault Tolerant K-Mutual Exclusion Algorithm

Self-stabilizing k-out-of-ℓ exclusion on tree networks.

Mutual exclusion in arbitrary networks when process identity numbers are not distinct

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