Concurrency in Snap-Stabilizing Local Resource Allocation - Archive ouverte HAL Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2014

Concurrency in Snap-Stabilizing Local Resource Allocation

Karine Altisen
  • Fonction : Auteur
Stéphane Devismes
Anaïs Durand

Résumé

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 Allocations 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 an high (but not maximal) level of concurrency, called here strong partial maximal-concurrency.
Fichier principal
Vignette du fichier
main.pdf (283.57 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et 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)

Identifiants

  • HAL Id : hal-01099186 , version 3

Citer

Karine Altisen, Stéphane Devismes, Anaïs Durand. Concurrency in Snap-Stabilizing Local Resource Allocation. [Research Report] VERIMAG. 2014. ⟨hal-01099186v3⟩
227 Consultations
282 Téléchargements

Partager

Gmail Facebook X LinkedIn More