Space and Time Efficient Self-Stabilizing ?-Exclusion in Tree Networks

Authors:
Affiliations:
Venue:
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Year:
2000

Citing 0
Cited 2

Space and time efficient self-stabilizing l-exclusion in tree networks

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A New Efficient Tool for the Design of Self-Stabilizing l-Exclusion Algorithms: The Controller

WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems

Quantified Score

Hi-index	0.02

Visualization

Abstract

We propose a very efficient self-stabilizing L-exclusion algorithm in rooted tree networks. The L-exclusion problem is a generalization of the mutual exclusion problem---we allow L (L=1) processors, instead of 1, to use a shared resource.The algorithm is semi-uniform and its space requirement is (L+3) Delta_r states (or |log((L+3) Delta_r)| bits) for the root r, 3 Delta_p states (or |log(3 Delta_p)| bits) for an internal processor p, and 2 states (or 1 bit) for a leaf processor, where Delta_p is the degree of processor p. Our algorithm is unique in the sense that this is the first L-exclusion algorithm on trees, whose space requirement is independent of the size of the network for any processor, and is independent of L for all processors except the root.