Skip to Main content Skip to Navigation
Conference papers

Hierarchical Token Based Mutual Exclusion Algorithms

Marin Bertier 1 Pierre Sens 1 Luciana Arantes 1
1 Regal - Large-Scale Distributed Systems and Applications
LIP6 - Laboratoire d'Informatique de Paris 6, Inria Paris-Rocquencourt
Abstract : 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.
Document type :
Conference papers
Complete list of metadata
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Wednesday, May 10, 2017 - 5:06:41 PM
Last modification on : Friday, January 8, 2021 - 5:46:03 PM

Links full text



Marin Bertier, Pierre Sens, Luciana Arantes. Hierarchical Token Based Mutual Exclusion Algorithms. 4th IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid '04), Apr 2004, Chicago, United States. pp.539-546, ⟨10.1109/CCGrid.2004.1336650⟩. ⟨hal-01520679⟩



Record views