A self‐stabilizing distributed algorithm for the local (1,|Ni|)‐critical section problem

Summary We consider the local (1,|Ni|)‐critical section (CS) problem where Ni is the set of neighboring processes for each process Pi. It dynamically maintains two disjoint dominating sets and is one of the generalizations of the mutual exclusion problem. The problem is one of controlling the system...

Full description

Bibliographic Details

Published in:	Concurrency and computation Vol. 33; no. 12
Main Authors:	Kamei, Sayaka, Kakugawa, Hirotsugu
Format:	Journal Article
Language:	English
Published:	Hoboken Wiley Subscription Services, Inc 25.06.2021
Subjects:	Algorithms disjoint minimal dominating sets domatic partition Matching mutual exclusion mutual inclusion Scheduling self‐stabilization
ISSN:	1532-0626, 1532-0634
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!