Evaluating quorum systems over the Internet (brief announcement) (original) (raw)

Abstract

Quorum systems serve as a basic tool providing a uniform and reliable way to achieve coordination in a distributed system. They are useful for distributed and replicated databases, name servers, mutual exclusion, and distributed access control and signatures.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (39)

  1. D. Agrawal and A. El-Abbadi. An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Trans. Comp. Sys., 9(1):1-20, 1991.
  2. Y. Amir, 1995. Personal communication.
  3. Y. Amir. Replication Using Group Communication Over a Dynamic Network. PhD thesis, Institute of Computer Sci- ence, The Hebrew University of Jerusalem,Israel. Also avail- able at http://www.cs.jhu.edu/yairamir, 1995.
  4. Y. Amir, D. Dolev, S. Kramer, and D. Malki. Membership algorithms for multicast communication groups. In Proc. 6th Inter. Workshop on Dist. Algorithms (WDAG), LNCS 647, pages 292-312. Springer-Verlag, 1992.
  5. Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A communication subsystem for high availability. In Proc. 22nd IEEE Symp. Fault-Tolerant Computing (FTCS), pages 76-84, 1992.
  6. Y. Amir, L. E. Moser, P. M. Melliar-Smith, D. A. Agarwal, and P. Ciarfella. The totem single-ring ordering and mem- bership protocol. ACM Trans. Comp. Sys., 13(4), 1995.
  7. Y. Amir and A. Wool. Optimal availability quorum sys- tems: Theory and practice. Technical Report CS96-02, The Weizmann Institute of Science, Rehovot, Israel, 1996.
  8. D. Barbara and H. Garcia-Molina. The reliability of vote mechanisms. IEEE Trans. Comput., C-36:1197-1208, Oct. 1987.
  9. P. A. Bernstein and N. Goodman. An algorithm for concur- rency control and recovery for replicated databases. ACM Transactions on Database Systems, 9(4), Dec. 1984.
  10. S. Y. Cheung, M. H. Ammar, and M. Ahamad. The grid protocol: A high performance scheme for maintaining repli- cated data. In Proc. 6th IEEE Int. Conf. Data Engineering, pages 438-445, 1990.
  11. S. B. Davidson, H. Garcia-Molina, and D. Skeen. Consis- tency in partitioned networks. ACM Computing Surveys, 17(3):341-370, 1985.
  12. K. Diks, E. Kranakis, D. Krizanc, B. Mans, and A. Pelc. Optimal coteries and voting schemes. Inf. Proc. Letters, 51:1-6, 1994.
  13. H. Garcia-Molina and D. Barbara. How to assign votes in a distributed system. J. ACM, 32(4):841-860, 1985.
  14. R. Golding and D. D. E. Long. Accessing replicated data in a large scale distributed system. Int. J. Comp. Simulation, 1(4):347-372, 1991.
  15. N. Goodman, D. Skeen, A. Chan, U. Dayal, S. Fox, and D. Ries. A recovery algorithm for a distributed database system. In Proc. 2nd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, Atlanta, 1983.
  16. M. Herlihy. Dynamic quorum adjustment for partitioned data. ACM Trans. Database Sys., 12(2):170-194, 1987.
  17. M. P. Herlihy. Replication Methods for Abstract Data Types. PhD thesis, Massachusetts Institute of Technology, MIT/LCS/TR-319, 1984.
  18. R. Holzman, Y. Marcus, and D. Peleg. Load balancing in quorum systems. In Proc. 4th Workshop on Algorithms and Data Structures,pages 38-49,Kingston, Ont., Canada, 1995. To appear in SIAM J. Discrete Math.
  19. T. Ibaraki, H. Nagamochi, and T. Kameda. Optimal coter- ies for rings and related networks. Distributed Computing, 8:191-201, 1995.
  20. S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintaining the consistency of a replicated database. ACM Trans. Database Sys., 15(2):230-280, 1990.
  21. D. B. Johnson and L. Raab. Effects of replication on data availability. Int. J. Comp. Simulation, 1(4):373-392, 1991.
  22. D. B. Johnson and L. Raab. A tight upper bound on the benefits of replica control protocols. J. Computer System Sci., 51:168-176, 1995.
  23. I. Keidar. A highly available paradigm for consistent object replication. Master's thesis, Institute of Computer Science, The Hebrew University of Jerusalem, Israel, 1994.
  24. M. L. Liu, D. Agrawal, and A. El Abbadi. On the implemen- tation of the quorum concensus protocol. In Proc. Parallel and Distributed Computing Systems., Orlando, 1995.
  25. M. Maekawa. A p n algorithm for mutual exclusion in de- centralized systems. ACM Trans. Comp. Sys., 3(2):145-159, 1985.
  26. D. A. Menascé, Y. Yesha, and K. Kalpakis. On a unified framework for the evaluation of distributed quorum attain- ment protocols. IEEE Trans. Software Eng.,20(11):868-884, 1994.
  27. L. E. Moser, Y. Amir, P. M. Melliar-Smith, and D. A. Agar- wal. Extended virtual synchrony. In Proc. 14th Inter. Conf. Dist. Comp. Sys., pages 56-65, June 1994.
  28. S. J. Mullender and P. M. B. Vitányi. Distributed match- making. Algorithmica, 3:367-391, 1988.
  29. M. Naor and A. Wool. The load, capacity and availability of quorum systems. In Proc. 35th IEEE Symp. Foundations of Comp. Sci. (FOCS), pages 214-225, 1994. To appear in SIAM J. Computing.
  30. M. Naor and A. Wool. Access control and signatures via quorum secret sharing. In Proc. 3rd ACM Conf. Comp. and Comm. Security, pages 157-168, New Delhi, India, Mar. 1996.
  31. M. Ogg, 1995. Personal communication.
  32. C. H. Papadimitriou and M. Sideri. Optimal coteries. In Proc. 10th ACM Symp. Princip. Distributed Computing (PODC), pages 75-80, 1991.
  33. J.-F. Pâris and D. D. E. Long. The performance of avail- able copy protocols for the management of replicated data. Performance Evaluation, 11:9-30, 1990.
  34. D. Peleg and A. Wool. The availability of quorum systems. Information and Computation, 123(2):210-223, 1995.
  35. D. Peleg and A. Wool. Crumbling walls: A class of practical and efficient quorum systems. In Proc. 14th ACM Symp. Princip. Distributed Computing (PODC), pages 120-129, Ottawa, Canada, 1995. To appear in Distributed Computing.
  36. M. Raynal. Algorithms for Mutual Exclusion. MIT press, 1986.
  37. M. Spasojevic and P. Berman. Voting as the optimal static pessimistic scheme for managing replicated data. IEEE Trans. Par. Dist. Sys., 5(1):64-73, 1994.
  38. D. Tang and R. K. Iyer. analysis and modeling of correlated failures in multicomputer systems. IEEE Trans. Comput., 41(5):567-577, 1992.
  39. T. W. Yan and H. Garcia-Molina. Distributed selective dis- semination of information. In Proc. 3rd Inter. Conf. Par. Dist. Info. Sys., pages 89-98, 1994.