| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Byte-Range Asynchronous Locking in Distributed Settings
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.
Cited literature [12 references]
https://hal.inria.fr/inria-00338189
Contributor : Martin Quinson <>
Submitted on : Friday, April 24, 2009 - 10:48:42 AM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM
Long-term archiving on: : Tuesday, October 9, 2012 - 3:15:37 PM
Contributor : Martin Quinson <>
Submitted on : Friday, April 24, 2009 - 10:48:42 AM
Last modification on : Friday, February 26, 2021 - 3:28:02 PM
Long-term archiving on: : Tuesday, October 9, 2012 - 3:15:37 PM
File
naimitrehel_PDP.pdf
Files produced by the author(s)