Reducing synchronization cost in distributed multi-resource allocation problemReport as inadecuate

Reducing synchronization cost in distributed multi-resource allocation problem - Download this document for free, or read online. Document in PDF available to download.

1 ASCOLA - Aspect and composition languages LINA - Laboratoire d-Informatique de Nantes Atlantique, Département informatique - EMN, Inria Rennes – Bretagne Atlantique 2 LINA 3 Regal - Large-Scale Distributed Systems and Applications LIP6 - Laboratoire d-Informatique de Paris 6, Inria Paris-Rocquencourt 4 UPMC - Université Pierre et Marie Curie - Paris 6 5 LIP6 - Laboratoire d-Informatique de Paris 6

Abstract : Generalized distributed mutual exclusion algorithmsallow 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.

Keywords : drinking philosophers multi-resource allocation distributed algorithm generalized mutual exclusion performance evaluation

Author: Jonathan Lejeune - Luciana Arantes - Julien Sopena - Pierre Sens -



Related documents