Distributed Mutual Exclusion Algorithms for Grid Applications: A Hierarchical Approach

Marin Bertier Luciana Arantes 1 Pierre Sens 1
1 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : The majority of current distributed mutual exclusion algorithms are not suited for parallel or distributed applications on a Grid as they do not consider the heterogeneity of latency on Grids. We propose two distributed mutual exclusion algorithms, based on Naimi-Trehel's token-based algorithm, which take into account latency gaps, especially those between local and remote clusters of machines. Our first algorithm exploits cluster locality by giving higher priority to critical section requests issued from nodes of the same cluster when compared to those from remote nodes. Our second algorithm adds a router layer to the first algorithm, bringing it closer to Grid network topology. Viewing each cluster as a single node, the Naimi-Trehel algorithm is applied to this router layer. Redirection of inter-cluster messages to cluster's nodes is then minimized.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01197364
Contributor : Lip6 Publications <>
Submitted on : Friday, September 11, 2015 - 3:27:36 PM
Last modification on : Friday, December 14, 2018 - 1:28:30 AM

Identifiers

Citation

Marin Bertier, Luciana Arantes, Pierre Sens. Distributed Mutual Exclusion Algorithms for Grid Applications: A Hierarchical Approach. Journal of Parallel and Distributed Computing, Elsevier, 2006, 66 (1), pp.128-144. ⟨10.1016/j.jpdc.2005.06.020⟩. ⟨hal-01197364⟩

Share

Metrics

Record views

210