The Community for Technology Leaders
2007 International Conference on Parallel Processing (ICPP 2007) (2007)
Xi'an, China
Sept. 10, 2007 to Sept. 14, 2007
ISSN: 0190-3918
ISBN: 0-7695-2933-X
pp: 65
Julien Sopena , LIP6-Universite de Paris 6, France
Fabrice Legond-Aubry , LIP6-Universite de Paris 6, France
Luciana Arantes , LIP6-Universite de Paris 6, France
Pierre Sens , LIP6-Universite de Paris 6, France
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.
INDEX TERMS
distributed mutual exclusion algorithm, Grid, performance evaluation.
CITATION

F. Legond-Aubry, P. Sens, L. Arantes and J. Sopena, "A Composition Approach to Mutual Exclusion Algorithms for Grid Applications," 2007 International Conference on Parallel Processing(ICPP), Xi'an, 2007, pp. 65.
doi:10.1109/ICPP.2007.6
91 ms
(Ver 3.3 (11022016))