Self-Stabilizing ℓ-Exclusion Revisited
Fabienne Carrier, Ajoy K. Datta, Stéphane Devismes, Lawrence L. Larmore · 2015
We consider the (deterministic) ℓ-exclusion problem, a generalization of the mutual exclusion problem which allows use of 1 ≤ ℓ < n identical copies of a non-sharable reusable resource among n processes, instead of only one, as standard mutual exclusion. This problem is defined using three properties: safety, fairness, and avoidance of ℓ-deadlock.