Planar quorums

DOI10.1016/S0304-3975(98)00208-4zbMATH Open0944.68004WikidataQ127956993 ScholiaQ127956993MaRDI QIDQ1575641FDOQ1575641

Authors: Rida A. Bazzi 

Publication date: 21 August 2000

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

Recommendations

• The Load, Capacity, and Availability of Quorum Systems
• The availability of quorum systems
• Optimal availability quorum systems: theory and practice
• Quorum systems constructed from combinatorial designs
• scientific article; zbMATH DE number 1559572

zbMATH Keywords

distributed systemsfault tolerancepercolationplanar graphsloadquorum systemscost of failures

Mathematics Subject Classification ID

Distributed systems (68M14)

Cites Work

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

Cited In (8)

• Planar quorums
• Billiard quorums on the grid
• Quorums from difference covers
• Scalable and dynamic quorum systems
• Access cost for asynchronous Byzantine quorum systems
• Probabilistic quorum systems
• Signed quorum systems
• \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion

This page was built for publication: Planar quorums

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1575641)