HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

A Composition Approach to Mutual Exclusion Algorithms for Grid Applications

Julien Sopena 1 Fabrice Legond-Aubry 2 Luciana Arantes 1 Pierre Sens 1
1 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
2 MoVe - Modélisation et Vérification
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We propose a new composition approach to mutual exclusion algorithms for applications spread over a grid which is composed of a federation of clusters. Taking into account the heterogeneity of communication latency, our hierarchical architecture combines intra and inter cluster algorithms. We focus on token-based algorithms and study different compositions of algorithms. Performance evaluation tests have been conducted on a national grid testbed whose results show that our approach is scalable and that the choice of the most suitable inter cluster algorithm depends on the behavior of the application.
Document type :
Conference papers
Complete list of metadata

Contributor : Julien Sopena Connect in order to contact the contributor
Submitted on : Tuesday, October 16, 2007 - 4:54:32 PM
Last modification on : Tuesday, March 22, 2022 - 11:10:10 AM



Julien Sopena, Fabrice Legond-Aubry, Luciana Arantes, Pierre Sens. A Composition Approach to Mutual Exclusion Algorithms for Grid Applications. The 36th International Conference on Parallel Processing (ICPP07), Sep 2007, XiAn, China. pp.65-65, ⟨10.1109/ICPP.2007.6⟩. ⟨inria-00179809⟩



Record views