Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
| Hi-index | 0.00 |
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. Lamport's algorithm and Ricart-Agrawal algorithm both have a synchronization delay of {\em $T$}, but their message complexity is {\em $O(N)$}. Maekawa's algorithm reduces message complexity to {\em $O(\sqrt{N})$}; however, it increases the synchronization delay to {\em $2T$}. After Maekawa's algorithm, many quorum-based mutual exclusion algorithms have been proposed to reduce message complexity or increase the resiliency to site and communication link failures. Since these algorithms are Maekawa-type algorithms, they also suffer from long synchronization delay {\em $2T$}. In this paper, we propose a delay-optimal quorum-based mutual exclusion algorithm which reduces the synchronization delay to {\em $T$} and still has the low message complexity {\em $O(K)$} {\em $(K$} is the size of the quorum, which can be as low as {\em $\log N)$}. A correctness proof and detailed performance analysis are provided.