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.

• Type: Conference
• Year: 2009
• Where: PDP
• Authors: Martin Quinson, Flavien Vernier
• Keywords: Mutual Exclusion Algorithm, Naimi-Trehel Algorithm, Original Naimi-trehel Algorithm, Parallel Computing, PDP 2009