How to assign votes in a distributed system
Journal of the ACM (JACM)
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 N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
The availability of quorum systems
Information and Computation
Load Balancing in Quorum Systems
SIAM Journal on Discrete Mathematics
The Load, Capacity, and Availability of Quorum Systems
SIAM Journal on Computing
Optimal Search on Some Game Trees
Journal of the ACM (JACM)
Average probe complexity of non-dominated coteries (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
SIAM Journal on Discrete Mathematics
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
A Dynamic Probe Strategy for Quorum Systems
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Niobe: A practical replication protocol
ACM Transactions on Storage (TOS)
| Hi-index | 0.00 |
This paper discusses the probe complexity of randomized algorithms and the deterministic average case probe complexity for some classes of nondominated coteries, including majority, crumbling walls, tree, wheel and hierarchical quorum systems, and presents upper and lower bounds for the probe complexity of quorum systems in these classes.