Reducing synchronization cost in distributed multi-resource allocation problem - Archive ouverte HAL Access content directly
Conference Papers 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
PID3746705.pdf (442.26 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01162329 , version 1 (10-06-2015)

Identifiers

Cite

Jonathan Lejeune, Luciana Arantes, Julien Sopena, Pierre Sens. Reducing synchronization cost in distributed multi-resource allocation problem. ICPP 2015 - 44th International Conference on Parallel Processing, Sep 2015, Beijing, China. pp.540-549, ⟨10.1109/ICPP.2015.63⟩. ⟨hal-01162329⟩
237 View
185 Download

Altmetric

Share

Gmail Facebook X LinkedIn More