How to assign votes in a distributed system
From MaRDI portal
Publication:3771671
DOI10.1145/4221.4223zbMath0633.68109OpenAlexW2052960791MaRDI QIDQ3771671
Daniel Barbará, Hector Garcia-Molina
Publication date: 1985
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/4221.4223
Related Items
Optimal coteries and voting schemes ⋮ Nondominated \(k\)-coteries for multiple mutual exclusion ⋮ Consensus in Data Management: From Distributed Commit to Blockchain ⋮ Billiard quorums on the grid ⋮ \((h,k)\)-arbiters for \(h\)-out-of-\(k\) mutual exclusion problem ⋮ Optimal availability quorum systems: theory and practice ⋮ A quorum based \(k\)-mutual exclusion by weighted \(k\)-quorum systems ⋮ Generating all maximal models of a Boolean expression ⋮ Signed quorum systems ⋮ On quorum systems for group resources allocation ⋮ Using integer programming to verify general safety and liveness properties ⋮ Decompositions of positive self-dual Boolean functions ⋮ Load balancing in quorum systems ⋮ On the fixed-parameter tractability of the equivalence test of monotone normal forms ⋮ A short technical paper: Determining whether a vote assignment is dominated ⋮ On generating all maximal independent sets ⋮ Quorum systems towards an asynchronous communication in cognitive radio networks ⋮ \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion ⋮ A fully distributed quorum consensus method with high fault-tolerance and low communication overhead ⋮ Analysis of quorum-based protocols for distributed (k+1)-exclusion ⋮ A highly fault-tolerant quorum consensus method for managing replicated data ⋮ The complexity of open k-monopolies in graphs for negative k ⋮ Bounding the open \(k\)-monopoly number of strong product graphs ⋮ Lower Bounds for Three Algorithms for the Transversal Hypergraph Generation ⋮ Nondominated local coteries for resource allocation in grids and clouds ⋮ \textsc{Ramos}: concurrent writing and reconfiguration for collaborative systems ⋮ Probabilistic quorums for dynamic systems ⋮ GeoQuorums: implementing atomic memory in mobile ad hoc networks ⋮ Exploiting logical structures in replicated databases ⋮ Competitive evaluation of threshold functions in the priced information model ⋮ Minimum self-dual decompositions of positive dual-minor Boolean functions ⋮ ModelingK-coteries by well-covered graphs ⋮ On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory ⋮ On multilevel voting ⋮ Optimal coteries for rings and related networks ⋮ Crumbling walls: a class of practical and efficient quorum systems ⋮ Synchronous Byzantine quorum systems ⋮ Access cost for asynchronous Byzantine quorum systems ⋮ A self-stabilizing quorum-based protocol for maxima computing ⋮ The congenial talking philosophers problem in computer networks ⋮ \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks ⋮ Threshold protocols in survivor set systems ⋮ A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data ⋮ Achieving New Upper Bounds for the Hypergraph Duality Problem through Logic ⋮ On the complexity of monotone dualization and generating minimal hypergraph transversals ⋮ Self-duality of bounded monotone Boolean functions and related problems ⋮ The availability of crumbling wall quorum systems ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ On the structure of minimal winning coalitions in simple voting games ⋮ Maximal sensitivity of Boolean nested canalizing functions ⋮ Competitive Boolean function evaluation: beyond monotonicity, and the symmetric case ⋮ Scalable and dynamic quorum systems ⋮ On the fractional chromatic number of monotone self-dual Boolean functions ⋮ Hypercube quorum consensus for mutual exclusion and replicated data management ⋮ Efficiently enumerating hitting sets of hypergraphs arising in data profiling ⋮ Average probe complexity in quorum systems ⋮ Lower bounds for three algorithms for transversal hypergraph generation ⋮ Planar quorums ⋮ Voting fairly: Transitive maximal intersecting families of sets ⋮ A simple scheme to construct \(k\)-coteries with \(O(\sqrt{N})\) uniform quorum sizes ⋮ Dynamic monopolies of constant size ⋮ Byzantine quorum systems with maximum availability. ⋮ Probabilistic quorum systems ⋮ A new transformation method for nondominated coterie design ⋮ A fast search algorithm for the quorumcast routing problem. ⋮ Efficient dualization of \(O(\log n\))-term monotone disjunctive normal forms ⋮ Local majorities, coalitions and monopolies in graphs: A review ⋮ A distributed \(k\)-mutual exclusion algorithm using \(k\)-coterie
