Byte-Range Asynchronous Locking in Distributed Settings

Martin Quinson (1) , Flavien Vernier (2)

1 ALGORILLE - Algorithms for the Grid
2 LISTIC - Laboratoire d'Informatique, Systèmes, Traitement de l'Information et de la Connaissance

This paper investigate a mutual exclusion algorithm on distributed systems. We introduce a new algorithm based on the Naimi-Trehel algorithm, taking advantage of the distributed approach of Naimi-Trehel while allowing to request partial locks. Such ranged locks offer a semantic close to POSIX file locking, where threads lock some parts of the shared file. We evaluate our algorithm by comparing its performance with to the original Naimi-Trehel algorithm and to a centralized mutual exclusion algorithm. The considered performance metric is the average time to obtain a lock.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Martin Quinson, Flavien Vernier. Byte-Range Asynchronous Locking in Distributed Settings. 17th Euromicro International Conference on Parallel, Distributed and network-based Processing - PDP 2009, Feb 2009, Weimar, Germany. ⟨inria-00338189⟩