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.
Type de document :
Communication dans un congrès
17th Euromicro International Conference on Parallel, Distributed and network-based Processing - PDP 2009, Feb 2009, Weimar, Germany. 2009
https://hal.inria.fr/inria-00338189
Contributeur : Martin Quinson
<>
Soumis le : vendredi 24 avril 2009 - 10:48:42
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48
Document(s) archivé(s) le : mardi 9 octobre 2012 - 15:15:37
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. 2009. 〈inria-00338189〉
