A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
The Byzantine Generals Problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Graphs and Hypergraphs
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
The vulnerability of vote assignments
ACM Transactions on Computer Systems (TOCS)
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
The Reliability of Voting Mechanisms
IEEE Transactions on Computers
Social choice theory and distributed decision making
COCS '88 Proceedings of the ACM SIGOIS and IEEECS TC-OA 1988 conference on Office information systems
Replicated data management in distributed database systems
ACM SIGMOD Record
A static pessimistic scheme for handling replicated databases
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Performance Characterization of Quorum-Consensus Algorithms for Replicated Data
IEEE Transactions on Software Engineering
Efficient solution to the distributed mutual exclusion problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Probabilistic language analysis of weighted voting algorithms
SIGMETRICS '90 Proceedings of the 1990 ACM SIGMETRICS conference on Measurement and modeling of computer systems
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Vote Assignments in Weighted Voting Mechanisms
IEEE Transactions on Computers
PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
A tight upper bound on the benefits of replication and consistency control protocols
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Distributed algorithms for dynamic replication of data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Design of optimal distributed file systems: a framework for research
ACM SIGOPS Operating Systems Review
The generalized tree quorum protocol: an efficient approach for managing replicated data
ACM Transactions on Database Systems (TODS)
Cost and availability tradeoffs in replicated data concurrency control
ACM Transactions on Database Systems (TODS)
Automated Derivation of Time Bounds in Uniprocessor Concurrent Systems
IEEE Transactions on Software Engineering
On a Unified Framework for the Evaluation of Distributed Quorum Attainment Protocols
IEEE Transactions on Software Engineering
Coding-Based Replication Schemes for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Performance Characterization of the Tree Quorum Algorithm
IEEE Transactions on Parallel and Distributed Systems
Information finding in a digital library: the Stanford perspective
ACM SIGMOD Record
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
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Access control and signatures via quorum secret sharing
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Floor control for multimedia conferencing and collaboration
Multimedia Systems
Cohorts Structures for Fault-Tolerant k Entries to a Critical Section
IEEE Transactions on Computers
An adaptive data replication algorithm
ACM Transactions on Database Systems (TODS)
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
Analysis of Quorum-Based Protocols for Distributed (k + 1)-Exclusion
IEEE Transactions on Parallel and Distributed Systems
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An inherent bottleneck in distributed counting
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The load and availability of Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Synchronous Byzantine quorum systems
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
A fault-tolerant dynamic triangular mesh protocol for distributed mutual exclusion
ACM SIGOPS Operating Systems Review
Optimal Diagnosis of Heterogeneous Systems with Random Faults
IEEE Transactions on Computers
Recognizing Nondominated Coteries and wr-Coteries by Availability
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
Access Control and Signatures via Quorum Secret Sharing
IEEE Transactions on Parallel and Distributed Systems
Improving the Availability of Mutual Exclusion Systems on Incomplete Networks
IEEE Transactions on Computers
Efficient generation of all regular non-dominated coteries
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
An Efficient SuperGrid Protocol for High Availability and Load Balancing
IEEE Transactions on Computers
Average probe complexity of non-dominated coteries (brief announcement)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Proceedings of the 2001 ACM symposium on Applied computing
Average probe complexity in quorum systems
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A distributed mutual exclusion solution derived from real-life examples
ACM-SE 30 Proceedings of the 30th annual Southeast regional conference
Coterie Join Operation and Tree Structured k-Coteries
IEEE Transactions on Parallel and Distributed Systems
Information and Computation
A Delay-Optimal Quorum-Based Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
New results on monotone dualization and generating hypergraph transversals
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Efficient selection and sorting schemes using coteries for processing large distributed files
Journal of Parallel and Distributed Computing
Byzantine quorum systems with maximum availabililty
Information Processing Letters
IEEE Transactions on Computers
Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data
IEEE Transactions on Knowledge and Data Engineering
A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting
IEEE Transactions on Knowledge and Data Engineering
Storage Efficient Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
IEEE Transactions on Knowledge and Data Engineering
Storage Efficient and Secure Replicated Distributed Databases
IEEE Transactions on Knowledge and Data Engineering
A New Dynamic Voting Algorithm for Distributed Database Systems
IEEE Transactions on Knowledge and Data Engineering
Using Reconfiguration for Efficient Management of Replicated Data
IEEE Transactions on Knowledge and Data Engineering
Mobile Computing and Databases-A Survey
IEEE Transactions on Knowledge and Data Engineering
IEEE Transactions on Parallel and Distributed Systems
A Theory of Coteries: Mutual Exclusion in Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data
IEEE Transactions on Parallel and Distributed Systems
Performance Evaluation of an Efficient Multiple Copy Update Algorithm
IEEE Transactions on Parallel and Distributed Systems
Message Complexity of the Tree Quorum Algorithm
IEEE Transactions on Parallel and Distributed Systems
Generating and Approximating Nondominated Coteries
IEEE Transactions on Parallel and Distributed Systems
Nondominated Coteries on Graphs
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Local majorities, coalitions and monopolies in graphs: a review
Theoretical Computer Science
Efficient dualization of O(log n)-term monotone disjunctive normal forms
Discrete Applied Mathematics
Obtaining Coteries That Optimize the Availability of Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
The group approach in cooperative work and in load balancing
Progress in computer research
Resilient Logical Structures for Efficient Management of Replicated Data
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Non-blocking Asynchronous Byzantine Quorum Systems
Proceedings of the 13th International Symposium on Distributed Computing
Quorum-Based Algorithms for Group Mutual Exclusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Group Protocol for Delivering Requests to Replicas
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
Mobile Agent Model for Transaction Processing in Distributed Database Systems
ICOIN '02 Revised Papers from the International Conference on Information Networking, Wireless Communications Technologies and Network Applications-Part II
Delay Optimizations in Quorum Consensus
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Evaluation of an Algorithm for the Transversal Hypergraph Problem
WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering
A Mobile Agent Enabled Fully Distributed Mutual Exclusion Algorithm
MA '02 Proceedings of the 6th International Conference on Mobile Agents
Self-Duality of Bounded Monotone Boolean Functions and Related Problems
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Quorum-Based Locking Protocol in Nested Invocations of Methods
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
The congenial talking philosophers problem in computer networks
Distributed Computing
Quorum-Based Algorithms for Group Mutual Exclusion
IEEE Transactions on Parallel and Distributed Systems
A survey of permission-based distributed mutual exclusion algorithms
Computer Standards & Interfaces
Evaluating quorum systems over the Internet
FTCS '96 Proceedings of the The Twenty-Sixth Annual International Symposium on Fault-Tolerant Computing (FTCS '96)
N-TSVS: a Videoconference Tool for Generic Cooperative Groups
MMM '98 Proceedings of the 1998 Conference on MultiMedia Modeling
Quorum-Based Protocol for Locking Replicas of Objects
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Scalable and dynamic quorum systems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Application-based dynamic primary views in asynchronous distributed systems
Journal of Parallel and Distributed Computing
Alternative Approaches to Distribute An E-Commerce Document Management System
RIDE '01 Proceedings of the 11th International Workshop on research Issues in Data Engineering
Distributed and Parallel Databases
Mobile agent model for transaction processing on distributed objects
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Introduction to multimedia and mobile agents
Power-saving protocols for IEEE 802.11-based multi-hop ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A delay optimal coterie on the k-dimensional folded Petersen graph
Journal of Parallel and Distributed Computing
A self-stabilizing quorum-based protocol for maxima computing
Distributed Computing
(h, k)-Arbiters for h-out-of-k mutual exclusion problem
Theoretical Computer Science
k-Coteries for Tolerating Network 2-Partition
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Synchronous Byzantine quorum systems
Distributed Computing
Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
Distributed power management protocols for multi-hop mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Access cost for asynchronous Byzantine quorum systems
Distributed Computing
Optimal coteries for rings and related networks
Distributed Computing
Fault-tolerance in the Borealis distributed stream processing system
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Distributed Computing
A Quorum-Based Protocol for Searching Objects in Peer-to-Peer Networks
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Quorum-Based Energy Conserving Protocol for IEEE 802.11 Ad Hoc Networks
IEEE Transactions on Mobile Computing
Optimal decision strategies in Byzantine environments
Journal of Parallel and Distributed Computing
Scalable and dynamic quorum systems
Distributed Computing
Average probe complexity in quorum systems
Journal of Computer and System Sciences
Probabilistic quorums for dynamic systems
Distributed Computing - Special issue: DISC 03
GeoQuorums: implementing atomic memory in mobile ad hoc networks
Distributed Computing - Special issue: DISC 03
Distributed Computing - Special issue: PODC 04
On the fixed-parameter tractability of the equivalence test of monotone normal forms
Information Processing Letters
On the complexity of the multiplication method for monotone CNF/DNF dualization
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Fault-tolerance in the borealis distributed stream processing system
ACM Transactions on Database Systems (TODS)
Self-duality of bounded monotone boolean functions and related problems
Discrete Applied Mathematics
On the complexity of monotone dualization and generating minimal hypergraph transversals
Discrete Applied Mathematics
On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Optimizing Threshold Protocols in Adversarial Structures
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Dual-quorum replication for edge services
Proceedings of the ACM/IFIP/USENIX 2005 International Conference on Middleware
Lower bounds for three algorithms for transversal hypergraph generation
Discrete Applied Mathematics
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Distributed power management protocols for multi-hop mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
On the fractional chromatic number of monotone self-dual Boolean functions
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Lower bounds for three algorithms for the transversal hypergraph generation
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Some fixed-parameter tractable classes of hypergraph duality and related problems
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Quorum-based power-saving multicast protocols in the asynchronous ad hoc network
Computer Networks: The International Journal of Computer and Telecommunications Networking
Probabilistic quorum systems in wireless Ad Hoc networks
ACM Transactions on Computer Systems (TOCS)
A token-based distributed algorithm for the generalized resource allocation problem
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Nondominated local coteries for resource allocation in grids and clouds
Information Processing Letters
Left-to-Right Multiplication for Monotone Boolean Dualization
SIAM Journal on Computing
The virtue of dependent failures in multi-site systems
HotDep'05 Proceedings of the First conference on Hot topics in system dependability
Competitive Boolean function evaluation: Beyond monotonicity, and the symmetric case
Discrete Applied Mathematics
Distributed priority inheritance for real-time and embedded systems
OPODIS'06 Proceedings of the 10th international conference on Principles of Distributed Systems
Quorum based distributed conflict resolution algorithm for bounded capacity resources
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
A group quorum system of degree 1+√1+n/m
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
A quorum based group k-mutual exclusion algorithm for open distributed environments
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Replication predicates for dependent-failure algorithms
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
A novel distributed scheduling algorithm for resource sharing under near-heavy load
OPODIS'04 Proceedings of the 8th international conference on Principles of Distributed Systems
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Two abstractions for implementing atomic objects in dynamic systems
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Replication techniques for availability
Replication
Dual-Quorum replication for edge services
Middleware'05 Proceedings of the ACM/IFIP/USENIX 6th international conference on Middleware
Ramos: Concurrent writing and reconfiguration for collaborative systems
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Research: Membership services and protocols for cooperative frameworks of processes
Computer Communications
A regular group quorum system of degree ⌈√n/2⌉
ICA3PP'12 Proceedings of the 12th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Deciding monotone duality and identifying frequent itemsets in quadratic logspace
Proceedings of the 32nd symposium on Principles of database systems
D-tunes: self tuning datastores for geo-distributed interactive applications
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
| Hi-index | 0.03 |
In a distributed system, one strategy for achieving mutual exclusion of groups of nodes without communication is to assign to each node a number of votes. Only a group with a majority of votes can execute the critical operations, and mutual exclusion is achieved because at any given time there is at most one such group. A second strategy, which appears to be similar to votes, is to define a priori a set of groups that intersect each other. Any group of nodes that finds itself in this set can perform the restricted operations. In this paper, both of these strategies are studied in detail and it is shown that they are not equivalent in general (although they are in some cases). In doing so, a number of other interesting properties are proved. These properties will be of use to a system designer who is selecting a vote assignment or a set of groups for a specific application.