This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data
September 1989 (vol. 1 no. 3)
pp. 387-397

In the weighted voting protocol which is used to maintain the consistency of replicated data, the availability of the data to ready and write operations not only depends on the availability of the nodes storing the data but also on the vote and quorum assignments used. The authors consider the problem of determining the vote and quorum assignments that yield the best performance in a distributed system where node availabilities can be different and the mix of the read and write operations is arbitrary. The optimal vote and quorum assignments depend not only on the system parameters, such as node availability and operation mix, but also on the performance measure. The authors present an enumeration algorithm that can be used to find the vote and quorum assignments that need to be considered for achieving optimal performance. When the performance measure is data availability, an analytical method is derived to evaluate it for any vote and quorum assignment. This method and the enumeration algorithm are used to find the optimal vote and quorum assignment for several systems. The enumeration algorithm can also be used to obtain the optimal performance when other measures are considered.

[1] S.B. Davidson, H. Garcia-Molina, and D. Skeen, "Consistency in a Partitioned Network,"ACM Computing Surveys, Vol. 17, No. 3, Sept. 1985, pp. 341-370.
[2] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[3] D. L. Eager and K. C. Sevcik, "Achieving robustness in distributed data-base systems,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 354-381, Sept. 1983.
[4] M. Herlihy, "Dynamic quorum adjustments for partitioned data," Carnegie-Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-86- 147, 1987.
[5] A. El Abbadi and S. Toueg, "Availability in partitioned replicated databases," inProc. 5th ACM Symp. Principles of Database Systems, 1986, pp. 240-251.
[6] S. Jajodia and D. Mutchler, "Dynamic voting," inProc. 1987 ACM SIGMOD, San Francisco, CA, May 1987, pp. 227-238.
[7] D. Barbara, H. Garcia-Molina, and A. Spauster, "Protocols for dynamic vote reassignment," inProc. ACM Conf. Principles Distributed Comput., 1986, pp. 195-205.
[8] J. Paris, "Voting with witnesses: A consistency scheme for replicated files," inProc. 6th Int. Conf. Distributed Comput. Syst., 1986, pp. 606-612.
[9] D. Davcev and W. Burkhard, "Consistency and recovery control for replicated files," inProc. 10th Symp. Operating System Principles, Orcas Island, WA, Dec. 1985, pp. 87-96.
[10] D. Agrawal and A. E. Abbadi, "Reducing storage for quorum consensus algorithms," inProc. Very Large Databases Conf., 1988, pp. 419-430.
[11] H. Garcia-Molina and D. Barbara, "How to assign votes in a distributed systems,"J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[12] L. Lamport, "The implementation of reliable distributed multiprocess systems,"Comput. Networks, vol. 2, pp. 95-114, 1978.
[13] D. Barbara and H. Garcia-Molina, "The reliability of voting mechanisms,"IEEE Trans. Comput., vol. C-36, no. 10, pp. 1197-1208, Oct. 1987.
[14] Z. Tong and R. Kain, "Vote assignments in weighted voting mechanisms," inProc. 7th Symp. Reliable Distributed Syst., 1988, pp. 138-143.
[15] M. Ahamad and M. Ammar, "Performance of quorum-consensus algorithms for replicated data,"IEEE Trans. Software Eng., vol. 15, no. 4, 1989.
[16] W. Smith and P. Decitre, "An evaluation method for analysis of the weighted voting algorithm for maintaining replicated data," inProc. 4th Int. Conf. Distributed Comput. Syst., 1984, pp. 494-502.
[17] A. F. Veinott and G. B. Dantzig, "Integral extreme points,"SIAM Rev., vol. 10, no. 3, pp. 371-372, 1968.
[18] J. P. Buzen, "Computational algorithms for closed queueing networks with exponential servers,"Commun. ACM, vol. 16, no. 9, Sept. 1973.
[19] J. J. Rotman,An Introduction to the Theory of Groups. Boston: Allyn and Bacon, 1984.

Index Terms:
vote optimizing; quorum assignments; reading; writing replicated data; weighted voting protocol; distributed system; node availabilities; operation mix; enumeration algorithm; optimal performance; distributed processing; fault tolerant computing; protocols
Citation:
S.Y. Cheung, M. Ahamad, M.H. Ammar, "Optimizing Vote and Quorum Assignments for Reading and Writing Replicated Data," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 3, pp. 387-397, Sept. 1989, doi:10.1109/69.87983
Usage of this product signifies your acceptance of the Terms of Use.