Optimal availability quorum systems: Theory and practice
- 13 March 1998
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 65 (5) , 223-228
- https://doi.org/10.1016/s0020-0190(98)00017-9
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Optimal coteries and voting schemesInformation Processing Letters, 1994
- A high availability √N hierarchical grid algorithm for replicated dataInformation Processing Letters, 1991
- Hierarchical quorum consensus: a new algorithm for managing replicated dataIEEE Transactions on Computers, 1991
- An efficient and fault-tolerant solution for distributed mutual exclusionACM Transactions on Computer Systems, 1991
- Distributed match-makingAlgorithmica, 1988
- The Reliability of Voting MechanismsIEEE Transactions on Computers, 1987
- How to assign votes in a distributed systemJournal of the ACM, 1985
- Consistency in a partitioned network: a surveyACM Computing Surveys, 1985
- A √N algorithm for mutual exclusion in decentralized systemsACM Transactions on Computer Systems, 1985
- INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETSThe Quarterly Journal of Mathematics, 1961