 |
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.
Cited literature [28 references]
https://hal.inria.fr/hal-01120808
Contributor : Jonathan Lejeune <>
Submitted on : Tuesday, March 24, 2015 - 6:24:39 PM
Last modification on : Thursday, March 21, 2019 - 1:08:10 PM
Document(s) archivé(s) le : Wednesday, November 9, 2016 - 12:23:40 PM
Contributor : Jonathan Lejeune <>
Submitted on : Tuesday, March 24, 2015 - 6:24:39 PM
Last modification on : Thursday, March 21, 2019 - 1:08:10 PM
Document(s) archivé(s) le : Wednesday, November 9, 2016 - 12:23:40 PM
File
RR-8689.pdf
Files produced by the author(s)
