Byte-Range Asynchronous Locking in Distributed Settings - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Byte-Range Asynchronous Locking in Distributed Settings


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.
Fichier principal
Vignette du fichier
naimitrehel_PDP.pdf (78.21 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00338189 , version 1 (24-04-2009)


  • HAL Id : inria-00338189 , version 1


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⟩
150 View
210 Download


Gmail Facebook Twitter LinkedIn More