Average probe complexity in quorum systems

This paper discusses the probe complexity of randomized algorithms and the deterministic average case probe complexity for some classes of nondominated coteries, including majority, crumbling walls, tree, wheel and hierarchical quorum systems, and presents upper and lower bounds for the probe complexity of quorum systems in these classes.

[1]  G. Grimmett,et al.  Probability and random processes , 2002 .

[2]  David Peleg,et al.  Crumbling walls: a class of practical and efficient quorum systems , 1995, PODC '95.

[3]  Robert H. Thomas,et al.  A Majority consensus approach to concurrency control for multiple copy databases , 1979, ACM Trans. Database Syst..

[4]  Michael E. Saks,et al.  Probabilistic Boolean decision trees and the complexity of evaluating game trees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[5]  Feng Xiao,et al.  Average probe complexity of non-dominated coteries (brief announcement) , 2000, PODC '00.

[6]  Mamoru Maekawa,et al.  A N algorithm for mutual exclusion in decentralized systems , 1985, TOCS.

[7]  Akhil Kumar,et al.  Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data , 1991, IEEE Trans. Computers.

[8]  Mitchell L. Neilsen.  A dynamic probe strategy for quorum systems , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.

[9]  David Peleg,et al.  Load Balancing in Quorum Systems , 1997, SIAM J. Discret. Math..

[10]  Andrew Chi-Chih Yao,et al.  Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[11]  Hector Garcia-Molina,et al.  How to assign votes in a distributed system , 1985, JACM.

[12]  Moni Naor,et al.  The Load, Capacity, and Availability of Quorum Systems , 1998, SIAM J. Comput..

[13]  David Peleg,et al.  How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems , 2002, SIAM J. Discret. Math..

[14]  Divyakant Agrawal,et al.  An efficient and fault-tolerant solution for distributed mutual exclusion , 1991, TOCS.

[15]  David Peleg,et al.  The Availability of Quorum Systems , 1995, Inf. Comput..

[16]  Toshihide Ibaraki,et al.  A Theory of Coteries: Mutual Exclusion in Distributed Systems , 1993, IEEE Trans. Parallel Distributed Syst..

[17]  Michael Tarsi,et al.  Optimal Search on Some Game Trees , 1983, JACM.