A Robust Permission-Based Hierarchical Distributed k-Mutual Exclusion Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

A Robust Permission-Based Hierarchical Distributed k-Mutual Exclusion Algorithm

Abstract

Distributed mutual exclusion is a basic building block of distributed systems that coordinates the access to critical shared resources. This work introduces a novel permission-based k-mutual exclusion algorithm for distributed systems with crash faults. Processes monitor each other and organize themselves on an adaptive virtual topology that is based on the hypercube and presents several logarithmic properties. Mutual exclusion is deployed on top of this monitoring system. Processes communicate through spanning trees which are created with a fully distributed strategy that tolerates faults by using process state information provided by the underlying monitoring system. Both the mutual exclusion and the distributed spanning tree algorithm are formally specified. The strategy is proven to guarantee the safety and liveness of the concurrent access of n processes to k critical resources. Experimental results are presented, showing that the algorithm performs efficiently even when up to n-1 processes are faulty.
No file

Dates and versions

hal-00931856 , version 1 (15-01-2014)

Identifiers

Cite

Luiz A. Rodrigues, Jaime Cohen, Luciana Arantes, Elias P Duarte Júnior. A Robust Permission-Based Hierarchical Distributed k-Mutual Exclusion Algorithm. The 12th International Symposium on Parallel and Distributed Computing, Jun 2013, Bucharest, Romania. pp.151-158, ⟨10.1109/ISPDC.2013.28⟩. ⟨hal-00931856⟩
160 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More