This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient SuperGrid Protocol for High Availability and Load Balancing
October 2000 (vol. 49 no. 10)
pp. 1126-1133

Abstract—Recently there has been a resurgence of interest in quorum-based methods for maintaining consistency of a group of replicated servers as a way to achieve load balancing in addition to high availability. We describe a SuperGrid protocol that performs well for small number of items (less than 100) and evaluate its performance analytically and through simulation experiments. Although it has been shown that it is possible to construct quorum systems where the load is $O(1/\sqrt N )$ and the availability is $\exp ( - \Omega (\sqrt N ))$, these asymptotic results do not perform very well when the number of items is relatively small. In such cases, our results show that the Supergrid protocol outperforms the recent Crumbling Walls protocol and the Paths system. It is also simple and easy to implement.

[1] D. Agrawal and A. El Abbadi, “An Efficient and Fault-Tolerant Algorithm for Distributed Mutual Exclusion,” Proc. Eighth Ann. ACM Symp. Principles of Distributed Computing, pp. 193-200, 1989.
[2] D. Agrawal and A. El Abbadi, “Exploiting Logical Structures in Replicated Databases,” Information Processing Letters, vol. 33, pp. 255-260, 1990.
[3] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[4] S.Y. Cheung, M. Ammar, and M. Ahamad, “The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data,” Proc. Sixth Int'l Conf. Data Eng., pp. 438-445, Feb. 1990.
[5] D. Davcev and W. Burkhard, “Consistency and Recovery Control for Replicated Files,” Proc. 10th ACM Symp. Operating Systems Principles, pp. 87-96, 1985.
[6] H. Garcia-Molina and D. Barbara, “How to Assign Votes in a Distributed System,” J. ACM, vol. 32, no. 4, pp. 841-860, Oct. 1985.
[7] D.K. Gifford, “Weighted Voting for Replicated Data,” Proc. Seventh ACM SIGOPS Symp. Operating Systems Principles, pp. 150-159, Dec. 1979.
[8] S. Jajodia and D. Mutchler, “Dynamic Voting Algorithms for Maintaining the Consistency of a Database,” ACM Trans. Data Systems, vol. 15, no. 2, pp. 230-280, June 1990.
[9] 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.
[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] M. Naor and A. Wool, “The Load, Capacity and Availability of Quorum Systems,” SIAM J. Computing, vol. 27, no. 2, pp. 423-447, Apr. 1998.
[12] D. Peleg and A. Wool, “Crumbling Walls: A Class of Practical and Efficient Quorum Systems,” Proc. 14th ACM Symp. Principles of Distributed Computing, pp. 120-129, 1995.
[13] R.H. Thomas, “A Majority Consensus Approach to Concurrency Control,” ACM Trans. Database Systems, vol. 4, no. 2, pp. 180-209, June 1979.
[14] A. Wool, “Quorum Systems in Replicated Databases: Science or Fiction,” IEEE Data Eng. Bulletin, vol. 21, no. 4, Dec. 1998.

Index Terms:
Server replication, availability, load balancing, quorum system, grid protocol, Crumbling Walls protocol, Paths system.
Citation:
Akhil Kumar, "An Efficient SuperGrid Protocol for High Availability and Load Balancing," IEEE Transactions on Computers, vol. 49, no. 10, pp. 1126-1133, Oct. 2000, doi:10.1109/12.888048
Usage of this product signifies your acceptance of the Terms of Use.