Scalable and Dynamic Quorum Systems

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 114-122

  Naor, Moni ^a   Wieder, Udi ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DATA STRUCTURES; PROBABILITY; PROGRAM PROCESSORS; RANDOM PROCESSES; SYSTEMS ANALYSIS;

HASH TABLES; QUORUM SYSTEMS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 1142268849     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872052     Document Type: Conference Paper

References (24)

1. Divyakant Agrawal, Omer Egecioglu, and Amr El Abbadi, Billiard quorums on the grid. Information Processing Letters, 64(1):9-16, 1997.
2. Rida A. Bazzi. Planar quorums. In Distributed Algorithms, 10th International Workshop, WDAG '96, volume 1151 of Lecture Notes in Computer Science, pages 251-268, Bologna, Italy, 9-11 October 1996. Springer.
3. Mark Bearden and Ronald P. Bianchini Jr. A fualt-tolerant algorithm for decentralizen on-line quorum adaptation. In Proceedings of FTCS-28, Munich, Germany, 2002.
4. Itai Benjamini. Private communication.
5. Hector Garcia-Molina and Daniel Barbara. How to assign votes in a distributed system. Journal of the Association for Computing Machinery, 32(4):841-855, October 1985.
6. Oded Goldreich. Randomized Methods in Computation - Lecture Notes, http://www.wisdom.weizmann.ac.il/̃oded/rnd.html,2001.
7. Geoffrey Grimmett. Percolation. Springer-Verlag, 1989.
8. Yehuda Hassin and David Peleg. Average probe complexity in quorum systems. In 20th ACM Symposium on Principles of Distributed Computing (PODC), 2001.
9. Sushil Jajodia and David Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Transactions on Database Systems, 15(2):230-280, June 1990.
10. Esti Yeger Lotem, Idit Keidar, and Danny Dolev. Dynamic voting for consistent primary components. In Symposium on Principles of Distributed Computing (PODC), pages 63-71, 1997.
11. Nancy A. Lynch and Alexander A. Shvartsman. Robust emulation of shared memory using dynamic quorum-acknowledged broadcasts. In Symposium on Fault-Tolerant Computing, pages 272-281, 1997.
12. Mamoru Maekawa. A √N algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems, 3(2):145-159, May 1985.
13. Dahlia Malkhi, Moni Naor, and David Ratajczak, Viceroy: A scalable and dynamic emulation of the butterfly. In ACM Conf. on Principles of Distributed Computing (PODC), 2002.
14. Mikhail V. Menshikov. Coincidence of critical points in percolation problems. Soviet Mathematics Doklady, 33:856-859, 1986.
15. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1997.
16. Moni Naor and Udi Wieder. Novel architectures for p2p applications: the continuous-discrete approach. In Fifteenth ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2003.
17. Moni Naor and Avishai Wool. Access control and signatures via quorum secret sharing. IEEE Transactions on Parallel and Distributed Systems, 9(9):909-922, 1998.
18. Moni Naor and Avishai Wool. The load, capacity, and availability of quorum systems. SIAM Journal on Computing, 27(2):423-447, 1998.
19. Atsyuki Okabe, Barry Boots, Kokichi Sugihara, and Sung Nok Chiu. Spatial Tessellations - Concepts and Applications of Voronoi Diagrams. Wiley, Chichester, second edition, 2000.
20. David Peleg and Avishai Wool. How to be an efficient snoop, or the probe complexity of quorum systems. SIAM Journal on Discrete Mathematics, 15(3):416-433, August 2002.
21. Roberto De Frisco, Alan Fekete, Nancy A. Lynch, and Alexander A. Shvartsman. A dynamic view-oriented group communication service. In Symposium on Principles of Distributed Computing (PODC), pages 227-236, 1998.
22. Sylvia Ratnasamy, Paul Francis, Mark Handley, Richard Karp, and Scott Shenker. A scalable content addressable network. In Proc ACM SIGCOMM, pages 161-172, 2001.
23. Beverly A. Sanders. The information structure of distributed mutual exclusion algorithms. ACM Transactions on Computer Systems, 5(3):284-299, August 1987.
24. Ian Stoica, Robert Morris, David Karger, Frans Kaashoek, and Hari Balakrishnan. Chord: A scalable Peer-To-Peer lookup service for internet applications. In Proceedings of the 2001 ACM SIGCOMM Conference, pages 149-160, 2001.