Skip to Main content Skip to Navigation
Conference papers

Byte-Range Asynchronous Locking in Distributed Settings

Martin Quinson 1 Flavien Vernier 2 
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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.
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Martin Quinson Connect in order to contact the contributor
Submitted on : Friday, April 24, 2009 - 10:48:42 AM
Last modification on : Saturday, June 25, 2022 - 7:41:48 PM
Long-term archiving on: : Tuesday, October 9, 2012 - 3:15:37 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads