Parul Pandey and Maheshwari Tripathi


  1. [1] M. Wiesmann, F. Pedone, A. Schiper, B. Kemme, and G.Alonso, Understanding replication in databases and distributed systems, Proc. 20th Int. Conf. on Distributed Computing Systems (ICDC2000), 2000, 264–274.
  2. [2] H. Gifford, Weighted voting for replicated data, Proc. 7th Symp. on Operating Systems, 1979, 150–162.
  3. [3] R.H. Thomas, A majority consensus approach to concurrency control for multiple copy databases, ACM Transactions on Database Systems, 4, 1979, 180–209.
  4. [4] M.L. Liu, D. Agrawal, and E.A. Abbadi, On the implemen-tation of the quorum concensus protocol, Proc. Parallel andDistributed Computing Systems, 1995.
  5. [5] D. Agrawal and A. Abbadi, The tree quorum protocol: anefficient approach for managing replicated data, VLDB ’90:Proc. 16th Int. Conf. on Very Large Data Bases, 1990, 243–254.
  6. [6] A.W.-C. Fu, Y.S. Wong, and M.H. Wong, Diamond quorumconsensus for high capacity and efficiency in a replicateddatabase system. Distributed Parallel Databases, 8, 2000, 471– 492.
  7. [7] N.C. Mendona and R.O. Anido, The hierarchical ring protocol: an efficient scheme for reading replicated data, Technical Report DCC-93-02, Department of Computer Science, University of Campinas, February 1993.
  8. [8] Y.-J. Chang, A triangular-mesh-based approach to fault-tolerant distributed mutual exclusion, Master’s thesis, National Sun Yat-sen University, June, 1995.
  9. [9] M.H. Ammar, S.Y. Cheung, and M. Ahamad, The grid protocol: a high performance scheme for maintaining replicated data, IEEE Transactions on Knowledge and Data Engineering, 4(6), 1992, 582–592.
  10. [10] Y.C. Kuo and S.T. Huang, A geometric approach for con-structing coteries and k-coteries, IEEE Transaction Parallel and Distributed Systems, 8(4), 1997, 402–411.
  11. [11] P. Pandey and M. Tripathi, A novel quorum protocol,arXiv:1403.5128.
  12. [12] A. Kumar, Hierarchical quorum consensus: a new algorithm for managing replicated data, IEEE Transactions on Computers, 40(9), 1991, 996–1004.
  13. [13] S. Jajodia and D. Mutchler, Dynamic voting, Proc. ACMSIGMOD Int. Conf. on Management of Data, June 1987,227–238.
  14. [14] D. Davcev and W. Burkhard, Consistency and recovery control for replicated files, Proc. Tenth ACM Symp. on Operating Systems Principles, December 1985, 87–96.
  15. [15] J.F. Paris and D.D.E. Long, Efficient dynamic voting algorithms, Proc. Fourth Int. Conf. on Data Engineering, 1988, 268–275.
  16. [16] L. Gao and Dahlin, Dual-quorum: a highly available and consistent replication system for edge services, IEEE Transactions on Dependable Secondary Computation, 7(2), 2010, 159–174.
  17. [17] M. Maekawa, A sqrt(N) algorithm for mutual exclusion in decentralized systems. ACM Transactions on ComputationSystems, 3(2), 1985, 145–159.
  18. [18] D. Agarwal and A. Abbadi, An efficient solution to the distributed mutual exclusion problem, Proc. Eighth ACM Symp. on Principles of Distributed Computing, August 1989, 193–200.
  19. [19] D. Agrawal and A. Abbadi, Exploiting logical structures in replicated databases, Information on Processing Letters, 33, 1990, 255–260.
  20. [20] D. Agrawal and A. Abbadi, The generalized tree quorumprotocol: an efficient approach for managing replicated data,ACM Transactions Database Systems, 17, 1992, 689–717.
  21. [21] C. Storm, T. Warns, and O. Theel, Flexible heterogeneous strict quorum-based dynamic data replication schemes, Proc. 2008 14th IEEE Pacific Rim Int. Symp. on Dependable Computing, 2008, 200–207.
  22. [22] M. Tripathi and P. Pandey, Message overhead analysis of quorum protocol, Proc. of Int. Conf. on Advances in Computing, 174, 2012, 237–245.

Important Links:

Go Back