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.
Type de document :
Communication dans un congrès
IEEE Computer Society. The 36th International Conference on Parallel Processing (ICPP07), Sep 2007, XiAn, China. IEEE Computer Society, pp.65-65, 2007, 〈10.1109/ICPP.2007.6〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00179809
Contributeur : Julien Sopena <>
Soumis le : mardi 16 octobre 2007 - 16:54:32
Dernière modification le : vendredi 31 août 2018 - 09:25:57

Identifiants

Collections

Citation

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

Partager

Métriques

Consultations de la notice

450