Distributed mutual exclusion algorithms for grid applications: A hierarchical approach
Journal of Parallel and Distributed Computing
Designing an Architecture for Distributed Shared Data on the Grid
ICA3PP '08 Proceedings of the 8th international conference on Algorithms and Architectures for Parallel Processing
Experiences on grid shared data programming
International Journal of Grid and Utility Computing
A fault-tolerant token-based mutual exclusion algorithm using a dynamic tree
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
| Hi-index | 0.00 |
Mutual exclusion is a basic block of distributed synchronization algorithms. One of the challenges in highly distributed environments (like peer-to-peer or Grid configurations) is to provide scalable synchronizations taking into account the hierarchical network topology. This paper proposes hierarchical mutual exclusion algorithms. These algorithms are extensions of the Naimi-Trehel token algorithm, reducing the cost of latency and the number of message exchanges between far hosts. We propose three main extensions : (1) hierarchical proxy-based approach; (2) aggregation of requests; and (3) token preemption by closer hosts. We compared the performance of these algorithms on an emulated Grid testbed. We study the impact of each of the extensions, showing that the combination of them can greatly improve performance of the original algorithm.