How to assign votes in a distributed system
Journal of the ACM (JACM)
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A simple taxonomy for distributed mutual exclusion algorithms
ACM SIGOPS Operating Systems Review
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
Comments on “Two algorithms for mutual exclusion in real-time distributed computer systems”
Journal of Parallel and Distributed Computing
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 simulation study on distributed mutual exclusion
Journal of Parallel and Distributed Computing
A dynamic request set based algorithm for mutual exclusion in distributed systems
ACM SIGOPS Operating Systems Review
A hybrid distributed mutual exclusion algorithm
Microprocessing and Microprogramming
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
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
A Resilient Mutual Exclusion Algorithm for Computer Networks
IEEE Transactions on Parallel and Distributed Systems
A Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Detecting termination of distributed computations using markers
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
A principle for resilient sharing of distributed resources
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Communications of the ACM
| Hi-index | 0.00 |
In the paper, we propose a dynamic triangular mesh protocol for mutual exclusion, in which the nodes in the system are organized into a triangular mesh. A quorum contains three dynamic paths in the given triangular mesh and the quorum size is k that is O(√N), where N is the number of nodes in the system and is equal to k(k+1)/2. The protocol is fault-tolerant up to (k - 1) site failures and communication failures in the worst case, even when such failures lead to network partitioning. From our simulation study, the proposed protocol can have higher availability and less quorum size than Cheung et al.'s grid protocol. Moreover, the quorum size of the proposed protocol will be less than that in Kumar's HQC protocol when N is greater than or equal to 15, and can be less than that in Agrawal et al.'s tree quorum protocol when node failures occur.