Self-stabilizing K-out-of-L exclusion on tree network

Ajoy Datta (1) , Stéphane Devismes (2) , Florian Horn (3) , Lawrence Larmore (1)

1 University of Nevada [Reno]
2 VERIMAG - IMAG - VERIMAG
3 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications

In this paper, we address the problem of K-out-of-L exclusion, a generalization of the mutual exclusion problem, in which there are $\ell$ units of a shared resource, and any process can request up to $\mathtt k$ units ($1\leq\mathtt k\leq\ell$). We propose the first deterministic self-stabilizing distributed K-out-of-L exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.

Mots clés: fault-tolerance; self-stabilization; resource allocation; K-out-of-L exclusion; oriented tree networks

Domaines: Réseaux et télécommunications [cs.NI]

Ajoy Datta, Stéphane Devismes, Florian Horn, Lawrence Larmore. Self-stabilizing K-out-of-L exclusion on tree network. 2008. ⟨hal-00344193v4⟩