How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems

DOI10.1137/S0895480198343819zbMATH Open1018.68004MaRDI QIDQ4785693FDOQ4785693

Avishai Wool, David Peleg

Publication date: 5 January 2003

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Recommendations

• Average probe complexity in quorum systems
• Average probe complexity in quorum systems
• The Load, Capacity, and Availability of Quorum Systems
• Scalable and dynamic quorum systems
• Scalable and dynamic quorum systems

zbMATH Keywords

distributed computingquorum systemsevasivenessstrong and simple games

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Noncooperative games (91A10) Distributed systems (68M14)

Cited In (5)

• Quorum systems constructed from combinatorial designs
• Distributed Computing
• \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
• Scalable and dynamic quorum systems
• Average probe complexity in quorum systems

This page was built for publication: How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems

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