Planar quorums

DOI10.1016/S0304-3975(98)00208-4zbMath0944.68004WikidataQ127956993 ScholiaQ127956993MaRDI QIDQ1575641

Rida A. Bazzi

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

distributed systemspercolationplanar graphsfault toleranceloadquorum systemscost of failures

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (5)

Signed quorum systems ⋮ \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion ⋮ Access cost for asynchronous Byzantine quorum systems ⋮ Scalable and dynamic quorum systems ⋮ Probabilistic quorum systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed match-making
• Triangular grid protocol: An efficient scheme for replica control with uniform access quorums
• The availability of quorum systems
• How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
• How to assign votes in a distributed system
• The Load, Capacity, and Availability of Quorum Systems
• Optimal coteries for rings and related networks
• Crumbling walls: a class of practical and efficient quorum systems

This page was built for publication: Planar quorums