This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A New Quorum-Based Scheme for Managing Replicated Data in Distributed Systems
December 2002 (vol. 51 no. 12)
pp. 1442-1447

Abstract—We propose a new quorum-based scheme for managing replicated data in distributed systems. We first introduce a concept called difference pair to establish the basics for cyclic read-write coteries. A simple and efficient model is then presented to facilitate the construction of read-write coteries. The read-write coteries generated by the model are strictly symmetric. Our model can be applied to an arbitrary number of copy sites. More importantly, by introducing a parameter in the construction model, our scheme offers the flexibility of adjusting the sizes of read and write quorums. Such flexibility allows read and write quorums to be readily tailored for each individual data item according to its own request demand. Enhancement of data availability is also addressed by our model.

[1] D. Agrawal and A.E. Abbadi, An Efficient and Fault-Tolerant Solution for Distributed Mutual Exclusion ACM Trans. Computing Systems, vol. 9, no. 1, pp. 1-20, 1991.
[2] P. Bernstein and N. Goodman, "The Failure and Recovery Problem for Replicated Databases," Proc. Second ACM Symp. Principles of Distributed Computing, pp. 114-122, Aug. 1983.
[3] S.Y. Cheung, M.H. Ammar, and M. Ahamad, "The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data," IEEE Trans. Knowledge and Data Eng., vol. 4, no. 6, pp. 582-592, 1992.
[4] C.-H. Cho and J.-T. Wang, ”Triangular Grid Protocol: An Efficient Scheme for Replica Control with Uniform Access Quorums,” Proc. Euro-Par '96 Parallel Processing Conf., pp. 843-851, Aug. 1996.
[5] G. Coulouris, J. Dollimore, and T. Kindberg, Distributed Systems, second ed. Addison-Wesley, 1994.
[6] M. Hall Jr., Combinatorial Theory. John Wiley&Sons, 1986.
[7] A. Kumar, “Hierarchical Quorum Consensus: A New Algorithm for Managing Replicated Data,” IEEE Trans. Computers, vol. 40, no. 9, pp. 996-1,004, Sept. 1991.
[8] Y.C. Kuo and S.T. Huang, A Geometric Approach for Constructing Coteries andk-Coteries IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 402-411, Apr. 1997.
[9] W.-S. Luk and T.-T. Wong, “Two New Quorum Based Algorithms for Distributed Mutual Exclusion,” Proc. 17th Int'l Conf. Distributed Computing Systems, May 1997.
[10] M. Maekawa, “A$\sqrt N $Algorithm for Mutual Exclusion in Decentralized Systems,” ACM Trans. Computer Systems, vol. 3, no. 2, pp. 145-159, May 1985.
[11] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.
[12] Y.-T. Wu, Y.-J. Chang, S.-M. Yuan, and H.-K. Chang, “A New Quorum-Based Replica Control Protocol,” Proc. 1997 Pacific Rim Int'l Symp. Fault Tolerant Systems, pp. 116-121, Dec. 1997.

Index Terms:
Consistency, coterie, mutual exclusion, quorum, replica control.
Citation:
Ching-Min Lin, Ge-Ming Chiu, Cheng-Hong Cho, "A New Quorum-Based Scheme for Managing Replicated Data in Distributed Systems," IEEE Transactions on Computers, vol. 51, no. 12, pp. 1442-1447, Dec. 2002, doi:10.1109/TC.2002.1146710
Usage of this product signifies your acceptance of the Terms of Use.