Self-stabilizing k-out-of-ℓ Exclusion on Tree networks
Document Type
Conference Proceeding
Publication Date
5-29-2009
Publication Title
IEEE International Symposium on Parallel and Distributed Processing
Volume
2009
Abstract
In this paper, we address the problem of k-out-of-lscr exclusion, a generalization of the mutual exclusion problem, in which there are lscr units of a shared resource, and any process can request up to k units (1 les k les lscr). We propose the first deterministic self-stabilizing distributed k-out-of-lscr exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.
Language
english
Repository Citation
Datta, A. K.,
Devismes, S.,
Horn, F.,
Larmore, L. L.
(2009).
Self-stabilizing k-out-of-ℓ Exclusion on Tree networks.
IEEE International Symposium on Parallel and Distributed Processing, 2009
http://dx.doi.org/10.1109/IPDPS.2009.5160875