English

A Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion

Distributed, Parallel, and Cluster Computing 2013-12-13 v1

Abstract

Quorum based mutual exclusion algorithms enjoy many advantages such as low message complexity and high failure resiliency. The use of quorums is a well known approach to achieving mutual exclusion in distributed environments. Several distributed based quorum mutual exclusion was presented.

Cite

@article{arxiv.1312.3347,
  title  = {A Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion},
  author = {M. Naimi and O. Thiare},
  journal= {arXiv preprint arXiv:1312.3347},
  year   = {2013}
}

Comments

7 pages, 9 figures

R2 v1 2026-06-22T02:25:55.055Z