Average probe complexity of non-dominated coteries (brief announcement)

Authors:
Tiko Kameda;Feng Xiao;Malika Guerni-Mahoui
Affiliations:
School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada;568 w. 25th, N. Vancouver, B.C., Canada;Department of Computer Science, University of Waikato, New Zealand
Venue:
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
Year:
2000

Citing 4
Cited 2

How to assign votes in a distributed system

Journal of the ACM (JACM)
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
A Theory of Coteries: Mutual Exclusion in Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
A Dynamic Probe Strategy for Quorum Systems

ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)

Average probe complexity in quorum systems

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Average probe complexity in quorum systems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

When nodes may fail, it is desirable to minimize the expected number of probes required to find a quorum. We show some properties of “probe trees”, propose several heuristics for finding an optimal probe strategy, and compare their performance.