This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting
December 1989 (vol. 1 no. 4)
pp. 459-469

A hybrid scheme that integrates the static voting protocol and dynamic voting with linearly ordered copies is proposed. A stochastic model is used to compare the file availability afforded by the proposed hybrid scheme with the availabilities of voting, dynamic voting, and dynamic voting with linearly ordered copies. The hybrid scheme has the most availability of these four algorithms for all reasonable repair/failure ratios tested.

[1] M. Ahamad and M. Ammar, "Performance characterization of quorum-consensus algorithms for replicated data," inProc. Symp. Reliability Distributed Software Database Syst., 1987, pp. 161-168.
[2] M. Ammar, M. Ahamad, and S. Cheung, "Reliability analysis of mutual exclusion using voting in a heterogeneous distributed system," Dep. Comput. Sci., Georgia Inst. Technol., Atlanta, Tech. Rep.
[3] R. Attar, P. A. Bernstein, and N. Goodman, "Site initialization, recovery, and backup in a distributed database system," inProc. 6th Berkeley Workshop Distributed Data Management Comput. Net works, 1982, pp. 185-202.
[4] D. Barbara and H. Garcia-Molina, "The reliability of voting mechanisms" Dep. Elec. Eng. Comput. Sci., Princeton Univ., Princeton, NJ, Tech. Rep. TR 330, 1984.
[5] D. Barbara and H. Garcia-Molina, "The vulnerability of vote assignments,"ACM Trans. Comput. Syst., vol. 4, no. 3, pp. 187-213, 1986.
[6] D. Barbara, H. Garcia-Molina, and A. Spauster, "Policies for dynamic vote reassignment," inProc. IEEE Conf. Distributed Comput., 1986, pp. 37-44.
[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] P. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems,"ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[9] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[10] S. Ceri and G. Pelagatti,Distributed Databases: Principles and Systems, McGraw-Hill, New York, 1984.
[11] B. W. Char, G. J. Fee, K. O. Geddes, G. H. Gonnet, and M. B. Monagan, "A tutorial introduction to Maple,"J. Symbolic Computat., vol. 2, no. 2, pp. 179-200, 1986.
[12] G. E. Collins and R. Loos, "Real zeros of polynomials," inComputer Algebra, Symbolic and Algebraic Computation, B. Buchberger, G. E. Collins, R. Loos, and R. Albrecht, Eds. New York Springer-Verlag, 1982 (Supplement 4 ofComputing).
[13] 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.
[14] 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.
[15] A. El Abbadi, D. Skeen, and F. Cristian, "An efficient, fault-tolerant protocol for replicated data management, inProc. 4th ACM SIGACT-SIGMOD Symp. Principles Database Syst., Portland, OR, Mar. 1985, pp. 215-228.
[16] A. El Abbadi and S. Toueg, "Availability in partitioned replicated databases," inProc. 5th ACM Symp. Principles of Database Systems, 1986, pp. 240-251.
[17] A. El Abbadi and S. Toueg, "Maintaining availabiity in partitioned replicated databases," Dep. Comput. Sci., Cornell Univ., Ithaca, NY, Tech. Rep. TR-87- 857.
[18] 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.
[19] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[20] S. Jajodia, "Managing replicated files in partitioned distributed database systems," inProc. IEEE 3rd Int. Conf. Data Eng., 1987, pp. 412-418.
[21] S. Jajodia and D. Mutchler, "Dynamic voting," inProc. 1987 ACM SIGMOD, San Francisco, CA, May 1987, pp. 227-238.
[22] S. Jajodia and D. Mutchler, "Enhancements to the voting algorithm," inProc. 13th Int. Conf. Very Large Data Bases, Sept. 1987, pp. 399-406.
[23] S. Jajodia and D. Mutchler, "A pessimistic consistency control algorithm for replicated files which achieves high availability,"IEEE Trans. Software Eng., vol. 15, pp. 39-46, 1989.
[24] S. Jajodia and D. Mutchler, "Dynamic voting algorithms for maintaining consistency of a replicated database,"ACM Trans. Database Syst., vol. 15, no. 2, June 1990.
[25] W. H. Kohler, "A survey of techniques for synchronization and recovery in decentralized computer systems,"ACM Computing Surveys, vol. 13, pp. 149-182, June 1981.
[26] L. Lamport, "The implementation of reliable distributed multiprocess systems,"Comput. Networks, vol. 2, pp. 95-114, 1978.
[27] T. Minoura and G. Wiederhold, "Resilient extended true-copy token scheme for a distributed database system,"IEEE Trans. Software Eng., vol. SE-8, no. 3, pp. 173-189, 1982.
[28] J.-F. Paris, "Voting with a variable number of copies," inProc. IEEE Int. Symp. Fault-Tolerant Comput., 1986, pp. 50-55.
[29] J.-F. Paris, "Voting with witnesses: A consistency scheme for replicated files," inProc. IEEE Int. Conf. Distributed Comput., 1986, pp. 606- 612.
[30] M. Pease, R. Shostak, and L. Lamport, "Reaching agreement in the presence of faults,"J. Ass. Comput. Mach., vol. 27, pp. 228-234, Apr. 1980.
[31] R. D. Schlichting and F.B. Schneider, "Fail-stop processors: An approach to designing fault-tolerant computing systems,"ACM Trans. Comput. Syst., vol. 1, no. 3, pp. 222-238, Aug. 1983.
[32] J. Seguin, G. Sergeant, and P. Wilms, "A majority consensus algorithm for the consistency of duplicated and distributed information," inProc. IEEE Int. Conf. Distributed Comput. Syst., 1979, pp. 617- 624.
[33] P. G. Selinger, "Replicated data," inDistributed Databases, I. W. Draffen and F. Poole, Eds. Cambridge: Cambridge University Press, 1980, pp. 223-231.
[34] D. Skeen and M. Stonebraker, "A formal model of crash recovery in a distributed system,"IEEE Trans. Software Eng., vol. SE-9, no. 3, pp. 219-228 1983.
[35] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180-209, June 1979.

Index Terms:
hybrid replica control algorithm; dynamic voting; static voting protocol; stochastic model; file availability; linearly ordered copies; file organisation; protocols; stochastic processes
Citation:
S. Jajodia, D. Mutchler, "A Hybrid Replica Control Algorithm Combining Static and Dynamic Voting," IEEE Transactions on Knowledge and Data Engineering, vol. 1, no. 4, pp. 459-469, Dec. 1989, doi:10.1109/69.43421
Usage of this product signifies your acceptance of the Terms of Use.