This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Nonblocking Quorum Consensus Protocol for Replicated Data
April 1991 (vol. 2 no. 2)
pp. 171-179

A nonblocking quorum protocol for replica control which guarantees one-copyserializability is developed. The effects of a nonblocking protocol are analyzed, and it isshown that the gains can be substantial under certain conditions. It is demonstrated thatin order for the protocol to be useful, it must be integrated with a propagationmechanism. It is also shown that the access latency can be reduced significantly in areplicated environment. An interesting aspect of the quorum protocol is that it essentiallyuses a read quorom/write-quorom approach for concurrency control but uses aread-one/write-all approach for replica control. It is shown that the nonblocking quoromprotocol provides the same level of availability and fault tolerance as the quorum protocol proposed by D.K. Gifford (1979).

[1] D. Agrawal, A. J. Bernstein, P. Gupta, and S. Sengupta, "Distributed optimistic concurrency control with reduced rollback,"Distributed Comput., vol. 2, no. 1, pp. 45-59, Jan. 1987.
[2] D. Agrawal and A. El Abbadi, "Integrating security with fault-tolerant distributed databases,"Comput. J., vol. 33, no. 1, pp. 71-78, Feb. 1990.
[3] D. Agrawal and A. El Abbadi, "Storage efficient replicated databases,"IEEE Trans. Knowledge Data Eng., vol. 2, no. 3, pp. 342-352, Sept. 1990.
[4] P. Bernstein and N. Goodman, "Concurrency Control in Distributed Database Systems,"ACM Computing Surveys, Vol. 13, No. 2, June 1981, pp. 185-221.
[5] P. A. Bernstein and N. Goodman, "The failure and recovery problem for replicated databases," inProc. 2nd Ann. Symp. Principles of Distributed Computing, 1983, pp. 114-122.
[6] 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. 596-615, Dec. 1984.
[7] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[8] W. A. Burkhard, B. E. Martin, and J. Paris, "The Gemini replicated file system test-bed," inProc. Third Int. Conf. Data Eng., Feb. 1987, pp. 441-448.
[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] S. Davidson, "Optimization and consistency in partitioned distributed database systems,"ACM Trans. Database Syst., vol. 9, no. 3, pp. 456-481, 1984.
[11] 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.
[12] A. Demerset al., "Epidemic algorithms for replicated database management," inProc. 6th ACM Symp. Principles Distributed Comput., 1987, pp. 1-12.
[13] 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.
[14] A. El Abbadi and S. Toueg, "Availability in partitioned replicated databases," inProc. 5th ACM Symp. Principles of Database Systems, 1986, pp. 240-251.
[15] K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, "The notions of consistency and predicate locks in a database system,"Commun. ACM, vol. 19, no. 11, pp. 624-633, Nov. 1976.
[16] W. Feller,An Introduction to Probability Theory and its Applications, Vol. 1. New York: Wiley, 1968.
[17] M. Fischer and A. Michael, "Sacrificing serializability to attain high availability of data in an unreliable network," inProc. 1st Symp. Principles Database Systems, Mar. 1982, pp. 70-75.
[18] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[19] J. Gray, "Notes on database operation systems," inOperating Systems: An Advanced Course(Lecture Notes in Computer Science, vol. 60) Berlin: Springer-Verlag, 1978.
[20] A. Heddaya, M. Hsu, and W. Weihl, "Two phase gossip: Managing distributed event histories," Tech. Rep. TR-04-87, Aiken Computation Lab., Harvard Univ., 1987.Information Sciences: An International Journal, to be published.
[21] M. Herlihy, "Dynamic quorum adjustment for partitional data,"ACM Trans. Database Syst., vol. 12, no. 2, pp. 170-194, June 1987.
[22] S. Jajodia and D. Mutchler, "Dynamic voting," inProc. 1987 ACM SIGMOD, San Francisco, CA, May 1987, pp. 227-238.
[23] T. Joseph and K. Birman, "Low cost management of replicated data in fault tolerant distributed systems,"ACM Trans. Comput. Syst., vol. 4, pp. 54-70, 1986.
[24] H. T. Kung and J. T. Robinson, "On optimistic methods for concurrency control,"ACM Trans. Database Syst., vol. 6, pp. 213-226, June 1981.
[25] L. Lamport, "Time, clocks, and the ordering of events in a distributed system,"Commun. ACM, vol. 21, no. 7, pp. 558-565, July 1978.
[26] B. Liskov and R. Ladin, "Highly available services in distributed systems," inProc. Fifth ACM Symp. Principles Distributed Comput., Aug. 1986, pp. 29-39.
[27] D.E. Long and J. F. Paris, "On improving the availability of replicated files," inProc. Sixth Symp. Reliability Distributed Software Database Syst., 1987, pp. 77-83.
[28] C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwarz, "ARIES: A transaction rccovery method supporting fine-granularity locking and partial rollbacks using write-ahead logging," IBM Res. Rep. RJ6649, Jan. 1989, IBM Almaden Research Center, submitted toACM Trans. Database Syst..
[29] B. Oki and B. Liskov, "Viewstamped replication: A new primary copy method to support highly-available distributed systems," inProc. Seventh ACM Symp. Principles Distributed Comput., Aug. 1988, pp. 8-17.
[30] C.H. Papadimitriou, "The serializability of concurrent database updates,"J. ACM, vol. 26, pp. 631-653, Oct. 1979.
[31] J. F. Pâris, "Voting with witnesses: A consistency scheme for replicated files," inProc. Sixth Int. Conf. Distributed Comput. Syst., June 1986, pp. 606-612.
[32] J. F. Pâris, "Voting with bystanders," inProc. Ninth Int. Conf. Distributed Comput. Syst., June 1989, pp. 394-401.
[33] J. F. Paris and D. Long, "Efficient dynamic voting," inProc. Fourth IEEE Int. Conf. Data Eng., Los Angeles, CA, Jan. 1988.
[34] C. Pu, J. D. Noe, and A. Proudfoot, "Regeneration of replicated objects: A technique and its Eden implementation,"IEEE Trans. Software Eng., vol. 14, no. 7, pp. 936-945, July 1988.
[35] D. P. Reed, "Naming and synchronization in a decentralized computer system," Ph.D. dissertation, Massachusetts Instit. Technol., 1978. Available as Tech. Rep. MIT/LCS/TR-205.
[36] 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.
[37] F. B. Schneider, "Synchronization in distributed programs,"ACM Trans. Programming Languages Syst., vol. 4, no. 2, pp. 125-148, Apr. 1982.
[38] M. Stonebraker, "Concurrency control and consistency in multiple copies of data in distributed INGRES,"IEEE Trans. Software Eng., vol. 3, no. 3, pp. 188-194, May 1979.
[39] R. V. Renesse and A. S. Tanenbaum, "Voting with ghosts," inProc. 8th IEEE Conf. Distributed Comput. Syst., 1988, pp. 456-462.
[40] G. T. Wuu and A. J. Bernstein, "Efficient solutions to the replicated log and dictionary problems," inProc. Third ACM Symp. Priniciples Distributed Comput., Aug. 1984, pp. 233-242.

Index Terms:
Index Termsnonblocking quorum protocol; replica control; one-copy serializability; access latency;availability; fault tolerance; database theory; distributed databases; fault tolerantcomputing; protocols
Citation:
D. Agrawal, A.J. Bernstein, "A Nonblocking Quorum Consensus Protocol for Replicated Data," IEEE Transactions on Parallel and Distributed Systems, vol. 2, no. 2, pp. 171-179, April 1991, doi:10.1109/71.89063
Usage of this product signifies your acceptance of the Terms of Use.