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 metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.inria.fr/inria-00338189
Contributor : Martin Quinson <>
Submitted on : Friday, April 24, 2009 - 10:48:42 AM
Last modification on : Friday, November 6, 2020 - 3:29:33 AM
Long-term archiving on: : Tuesday, October 9, 2012 - 3:15:37 PM

File

naimitrehel_PDP.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00338189, version 1

Citation

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⟩

Share

Metrics

Record views

426

Files downloads

382