Concurrency in Snap-Stabilizing Local Resource Allocation - Archive ouverte HAL Access content directly
Journal Articles Journal of Parallel and Distributed Computing Year : 2016

Concurrency in Snap-Stabilizing Local Resource Allocation

Karine Altisen
  • Function : Author
Stéphane Devismes
Anaïs Durand


In distributed systems, resource allocation consists in managing fair access of a large number of processes to a typically small number of reusable resources. As soon as the number of available resources is greater than one, the efficiency in concurrent accesses becomes an important issue, as a crucial goal is to maximize the utilization rate of resources. In this paper, we tackle the concurrency issue in resource allocation problems. We first characterize the maximal level of concurrency we can obtain in such problems by proposing the notion of maximal-concurrency. Then, we focus on Local Resource Allocation problems (LRA). Our results are both negative and positive. On the negative side, we show that it is impossible to obtain maximal-concurrency in LRA without compromising the fairness. On the positive side, we propose a snap-stabilizing LRA algorithm which achieves a high (but not maximal) level of concurrency, called here strong partial maximal-concurrency.
Fichier principal
Vignette du fichier
main-tr.pdf (388.94 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01099186 , version 1 (31-12-2014)
hal-01099186 , version 2 (09-01-2015)
hal-01099186 , version 3 (15-01-2015)
hal-01099186 , version 4 (16-01-2015)
hal-01099186 , version 5 (07-04-2015)
hal-01099186 , version 6 (08-04-2015)
hal-01099186 , version 7 (22-01-2016)
hal-01099186 , version 8 (17-11-2016)


  • HAL Id : hal-01099186 , version 8


Karine Altisen, Stéphane Devismes, Anaïs Durand. Concurrency in Snap-Stabilizing Local Resource Allocation. Journal of Parallel and Distributed Computing, 2016. ⟨hal-01099186v8⟩
210 View
263 Download


Gmail Facebook Twitter LinkedIn More