Minimizing the maximum delay for reaching consensus in quorum-based mutual exclusion schemes

Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes

ÐThe use of quorums is a well-known approach to achieving mutual exclusion in distributed computing systems. This approach works based on a coterie, a special set of node groups where any pair of the node groups shares at least one common node. Each node group in a coterie is called a quorum. Mutual exclusion is ensured by imposing that a node gets consensus from all nodes in at least one of th...

Hypercube Quorum Consensus for Mutual Exclusion and Replicated Data Management

Quorum-Based Mutual Exclusion Algorithms: A Survey

The development of highly complex software, communication interfaces and the presence of low-cost processors are key factors towards the design of distributed applications. By distributing a computation, processes are permitted to run concurrently, share resources among themselves and at the same time working independent of each other. Distributed computations that involve sharing of resources ...

A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems

ÐThe performance of a mutual exclusion algorithm is measured by the number of messages exchanged per critical section execution and the delay between successive executions of the critical section. There is a message complexity and synchronization delay trade-off in mutual exclusion algorithms. The Lamport algorithm and the Ricart-Agrawal algorithm both have a synchronization delay of T (T is th...

A Distributed Deadlock Free Quorum Based Algorithm for Mutual Exclusion

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. The number of messages required by these algorithms require between 3 and 5 , where n is the size of under...