How to assign votes in a distributed system
Journal of the ACM (JACM)
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data
IEEE Transactions on Computers
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms
IEEE Transactions on Parallel and Distributed Systems
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A Fault-Tolerant Algorithm for Replicated Data Management
IEEE Transactions on Parallel and Distributed Systems
Crumbling walls: a class of practical and efficient quorum systems
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
A simulation study on distributed mutual exclusion
Journal of Parallel and Distributed Computing
A Geometric Approach for Constructing Coteries and k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Delay-Optimal Quorum Consensus for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
A Fair Distributed Mutual Exclusion Algorithm
IEEE Transactions on Parallel and Distributed Systems
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
An Architecture for Survivable Coordination in Large Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Two New Quorum Based Algorithms for Distributed Mutual Exclusion
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Coterie templates: a new quorum construction method
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
A fault tolerant mutual exclusion algorithm for mobile ad hoc networks
Pervasive and Mobile Computing
ISWPC'09 Proceedings of the 4th international conference on Wireless pervasive computing
Hopping sensor relocation in rugged terrains
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Info-based approach in distributed mutual exclusion algorithms
Journal of Parallel and Distributed Computing
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. The Lamport algorithm and the Ricart-Agrawal algorithm both have a synchronization delay of T (T is the average message delay), but their message complexity is O(N). Maekawa's algorithm reduces the message complexity to O(\sqrt{N}); however, it increases the synchronization delay to 2T. After Maekawa's algorithm, many quorum-based mutual exclusion algorithms have been proposed to reduce the message complexity or the increase the resiliency to site and communication link failures. Since these algorithms are Maekawa-type algorithms, they also suffer from the long synchronization delay. In this paper, we propose a delay-optimal quorum-based mutual exclusion algorithm which reduces the synchronization delay to T and still has a low message complexity of O(K) (K is the size of the quorum which can be as low as \log N). A correctness proof and a detailed performance analysis are provided.