Reducing synchronization cost in distributed multi-resource allocation problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2015

Reducing synchronization cost in distributed multi-resource allocation problem

Abstract

Generalized distributed mutual exclusion algorithms allow processes to concurrently access a set of shared resources. However, they must ensure an exclusive access to each resource. In order to avoid deadlocks, many of them are based on the strong assumption of a prior knowledge about conflicts between processes' requests. Some other approaches, which do not require such a knowledge, exploit broadcast mechanisms or a global lock, degrading message complexity and synchronization cost. We propose in this paper a new solution for shared resources allocation which reduces the communication between non-conflicting processes without a prior knowledge of processes conflicts. Performance evaluation results show that our solution improves resource use rate by a factor up to 20 compared to a global lock based algorithm.
Fichier principal
Vignette du fichier
RR-8689.pdf (1.09 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01120808 , version 1 (26-02-2015)
hal-01120808 , version 2 (24-03-2015)

Identifiers

  • HAL Id : hal-01120808 , version 2

Cite

Jonathan Lejeune, Luciana Arantes, Julien Sopena, Pierre Sens. Reducing synchronization cost in distributed multi-resource allocation problem. [Research Report] RR-8689, Ecole des Mines de Nantes, Inria, LINA; Sorbonne Universités, UPMC, CNRS, Inria, LIP6; INRIA. 2015. ⟨hal-01120808v2⟩
396 View
425 Download

Share

Gmail Facebook X LinkedIn More