How to assign votes in a distributed system
Journal of the ACM (JACM)
Algorithms for mutual exclusion
Algorithms for mutual exclusion
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Diamond Quorum Consensus for High Capacity and Efficiency in a Replicated Database System
Distributed and Parallel Databases
Coterie Join Operation and Tree Structured k-Coteries
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
The tree quorum algorithm (TQA) uses a tree structure to generate intersecting (tree) quorums for distributed mutual exclusion. This paper analyzes the number of messages required to acquire a quorum in TQA. Let i be the depth of the complete binary tree used in TQA, and let Mi be the number of messages required to acquire a quorum or to determine that no quorum is accessible. We discuss Mi as a function of i and p, where $p\left({1\over 2}