
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
M. Spasojevic, P. Berman, "Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data," IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 1, pp. 6473, January, 1994.  
BibTex  x  
@article{ 10.1109/71.262589, author = {M. Spasojevic and P. Berman}, title = {Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {5}, number = {1}, issn = {10459219}, year = {1994}, pages = {6473}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.262589}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Voting as the Optimal Static Pessimistic Scheme for Managing Replicated Data IS  1 SN  10459219 SP64 EP73 EPD  6473 A1  M. Spasojevic, A1  P. Berman, PY  1994 KW  Index Termsdistributed databases; software reliability; protocols; local area networks; optimal staticpessimistic scheme; replicated data; voting schemes; Ethernet systems; optimal voteassignment; fully connected networks VL  5 JA  IEEE Transactions on Parallel and Distributed Systems ER   
This paper investigates the problem of finding an optimal static pessimistic replica control scheme. It has been widely accepted that coteries (proposed by GarciaMolina and Barbara) provide the most general framework for such schemes. We demonstrate that voting schemes, a very small subset of static pessimistic schemes, are optimal for fully connected networks with negligible link failure rates, as well as for Ethernet systems. Wealso show that voting is not optimal for somewhat more general systems. We propose amodification of the algorithm of Z. Tong and R.Y. Kain (1988) for computing optimal voting in operation independent case, so that it runs in linear (rather than exponential) time. Finally, we propose the first efficient algorithm for computing the optimal vote assignment and appropriate thresholds for fully connected networks when relative frequencies of read and write operations are known. We also extend this result to Ethernet systems.
[1] M. Ahamad and M. H. Ammar, "Performance characterization of quorumconsensus algorithms for replicated data," inProc. IEEE Conf. Reliability in Distributed Software and Database Systems, pp. 161167, 1987.
[2] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, AddisonWesley, Reading, Mass., 1987.
[3] P. A. Bernstein and N. Goodman, "An algorithm for concurrency control and recovery in replicated distributed databases,"ACM Trans. Database Syst., vol. 9, no. 4, pp. 596615, Dec. 1984.
[4] S. Y. Cheunget al., "Optimizing vote and quorum assignments for reading and writing replicated data," inProc. Fifth IEEE Int. Conf. Data Eng., Los Angeles, CA, Jan. 1989.
[5] S. Y. Cheunget al., "Multidimensional voting: A general method for implementing synchronization in distributed systems," inProc. Tenth Int. Conf. Distributed Comput. Syst., Paris, June 1990.
[6] S.B. Davidson, H. GarciaMolina, and D. Skeen, "Consistency in a Partitioned Network,"ACM Computing Surveys, Vol. 17, No. 3, Sept. 1985, pp. 341370.
[7] H. GarciaMolina and D. Barbara, "Optimizing the reliability provided by voting mechanisms," inProc. 4th Int. Conf. Distributed Computing Systems, pp. 340346, 1984.
[8] H. GarciaMolina and D. Barbara, "How to assign votes in a distributed systems,"J. ACM, vol. 32, no. 4, pp. 841860, Oct. 1985.
[9] D. Barbara, H. GarciaMolina, and A. Spauster, "Protocols for dynamic vote reassignment," inProc. ACM Conf. Principles Distributed Comput., 1986, pp. 195205.
[10] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150162.
[11] M. P. Herlihy, "A quorumconsensus replication method for abstract data types,"ACM Trans. Comput. Syst., vol. 4, no. 1, Feb. 1986.
[12] S. Jajodia and D. Mutchler, "Enhancements to the voting algorithm," inProc. 13th Int. Conf. Very Large Data Bases, Sept. 1987, pp. 399406.
[13] S. Jajodia and D. Mutchler, "Dynamic voting," inProc. 1987 ACM SIGMOD, San Francisco, CA, May 1987, pp. 227238.
[14] S. Jajodia and D. Mutchler, "Integrating static and dynamic voting protocols to enhance file availability," inProc. 4th IEEE Int. Conf. Data Eng., 1988, pp. 144153.
[15] 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.
[16] M. Obradovic and P. Berman, "Voting as the optimal static pessimistic scheme for managing replicated data," inProc. 9th Symp. Reliable Distributed Syst., 1990, pp. 126135.
[17] M. Obradovic and P. Berman, "Weighted voting for operation dependent management of replicated data," inProc. 4th Int. Workshop on Distributed Algorithms, Lecture Notes in Computer Science. New York: Springer, 1990, pp. 263276.
[18] M. Spasojevic, "Optimal replica control protocols for ring networks," inProc. 11th IEEE Symp. Reliable Distributed Syst., 1992, pp. 5765.
[19] J. F. Paris and D. Long, "Efficient dynamic voting," inProc. Fourth IEEE Int. Conf. Data Eng., Los Angeles, CA, Jan. 1988.
[20] A. Rosenthal, "Computing the reliability of a complex network,"SIAM J. Appl. Math., vol. 32, pp. 384393, 1977.
[21] J. Tang and N. Natarajan, "A static pessimistic scheme for handling replicated databases," inProc. 1989 ACM SIGMOD Int. Conf. Management Data, June 1989, pp. 389398.
[22] J. Tang and N. Natarajan, "A static pessimistic scheme for managing replicated databases," Dept. of Computer Science, Penn State Univ., Tech. Rep., Feb. 1990.
[23] R. Thomas, "A majority consensus approach to concurrency control,"ACM Trans. Database Syst., vol. 4, pp. 180209, June 1979.
[24] Z. Tong and R. Kain, "Vote assignments in weighted voting mechanisms," inProc. 7th Symp. Reliable Distributed Syst., 1988, pp. 138143.