A distributed k-mutual exclusion algorithm based on autonomic spanning trees

Abstract : Distributed -mutual exclusion ensures that at most a single process has permission to access each of the copies of a critical resource. In this work we present an autonomic solution for distributed -mutual exclusion that adapts itself after system changes. Our solution employs a hierarchical best-effort broadcast algorithm to propagate messages reliably and efficiently. The broadcast is based on another autonomic building block: a distributed algorithm for creating and maintaining spanning trees constructed in a fully distributed and adaptive way on top of a virtual hypercube-like topology, called VCube. The proposed solutions are autonomic in the sense that they reconfigure themselves automatically after the detection of faults given the set of correct processes in the system. All proposed algorithms are described, specified, and proofs of correctness are given. Results from simulation show that the proposed approach is more efficient and scalable compared to other solutions.
Complete list of metadatas

https://hal.inria.fr/hal-01965673
Contributor : Luciana Arantes <>
Submitted on : Wednesday, December 26, 2018 - 4:59:12 PM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM

Identifiers

Citation

Luiz Rodrigues, Elias Duarte Júnior, Luciana Arantes. A distributed k-mutual exclusion algorithm based on autonomic spanning trees. Journal of Parallel and Distributed Computing, Elsevier, 2018, 115, pp.41-55. ⟨10.1016/j.jpdc.2018.01.008⟩. ⟨hal-01965673⟩

Share

Metrics

Record views

84