The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2009)
Rome, Italy
May 23, 2009 to May 29, 2009
ISBN: 978-1-4244-3751-1
pp: 1-8
Ajoy K. Datta , School of Computer Science - University of Nevada - Las Vegas, USA
Stephane Devismes , VERIMAG - Université Joseph Fourier - Grenoble, France
Florian Horn , LIAFA - Université Paris Denis Diderot, France
Lawrence L. Larmore , School of Computer Science - University of Nevada - Las Vegas, USA
ABSTRACT
In this paper, we address the problem of k-out-of-ℓ exclusion, a generalization of the mutual exclusion problem, in which there are ℓ units of a shared resource, and any process can request up to k units (1 ≤ k ≤ ℓ). We propose the first deterministic self-stabilizing distributed k-out-of-ℓ exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.
INDEX TERMS
CITATION

S. Devismes, A. K. Datta, L. L. Larmore and F. Horn, "Self-Stabilizing k-out-of-l exclusion on tree networks," 2009 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), Rome, 2009, pp. 1-8.
doi:10.1109/IPDPS.2009.5160875
82 ms
(Ver 3.3 (11022016))