|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| S.Y. Cheung, M.H. Ammar, M. Ahamad, "The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data," IEEE Transactions on Knowledge and Data Engineering, vol. 4, no. 6, pp. 582-592, December, 1992. | |||
| BibTex | x | ||
| @article{ 10.1109/69.180609, author = {S.Y. Cheung and M.H. Ammar and M. Ahamad}, title = {The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {4}, number = {6}, issn = {1041-4347}, year = {1992}, pages = {582-592}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.180609}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Knowledge and Data Engineering TI - The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data IS - 6 SN - 1041-4347 SP582 EP592 EPD - 582-592 A1 - S.Y. Cheung, A1 - M.H. Ammar, A1 - M. Ahamad, PY - 1992 KW - replicated data maintenance; distributed database; grid protocol; high data availability; low response time; load sharing; transaction processing; system throughput; simulation; voting-based scheme; database theory; distributed databases; transaction processing VL - 4 JA - IEEE Transactions on Knowledge and Data Engineering ER - | |||
A new protocol for maintaining replicated data that can provide both high data availability and low response time is presented. In the protocol, the nodes are organized in a logical grid. Existing protocols are designed primarily to achieve high availability by updating a large fraction of the copies, which provides some (although not significant) load sharing. In the new protocol, transaction processing is shared effectively among nodes storing copies of the data, and both the response time experienced by transactions and the system throughput are improved significantly. The authors analyze the availability of the new protocol and use simulation to study the effect of load sharing on the response time of transactions. They also compare the new protocol with a voting-based scheme.
[1] 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.
[2] M. Ahamad and M. Ammar, "Performance characterization of quorum-consensus algorithms for replicated data,"IEEE Trans. Software Eng., vol. 15, pp. 492-496, 1989.
[3] D. Gifford, "Weighted voting for replicated data," inProc. 7th ACM Symp. Oper. Syst. Principles, Dec. 1979, pp. 150-162.
[4] J.-F. Pâris, "Voting with witnesses: A consistency scheme for replicated files," inProc. 6th Int. Conf. on Distributed Computing Systems, IEEE, 1986, pp. 606-612.
[5] D. L. Eager and K. C. Sevcik, "Achieving robustness in distributed data-base systems,"ACM Trans. Database Syst., vol. 8, no. 3, pp. 354-381, Sept. 1983.
[6] D. Barbara and H. Garcia-Molina, "Mutual exclusion in partitioned distributed systems,"Distributed Comput., vol. 1, pp. 119-132, 1986.
[7] 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.
[8] M. Maekawa, "A√N algorithm for mutual exclusion in decentralized systems,"ACM Trans. Comput. Syst., vol. 3, no. 2, May 1985.
[9] M. Herlihy, "Dynamic quorum adjustment for partitional data,"ACM Trans. Database Syst., vol. 12, no. 2, pp. 170-194, June 1987.
[10] 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.
[11] S. Jajodia and D. Mutchler, "Dynamic voting," inProc. 1987 ACM SIGMOD, San Francisco, CA, May 1987, pp. 227-238.
[12] D. Barbara, H. Garcia-Molina, and A. Spauster, "Increasing availability under mutual exclusion constraints with dynamic vote reassignment,"ACM Trans. Computer Syst., vol. 7, pp. 394-426, Nov. 1989.
[13] A. El Abbadi and S. Toueg, "Availability in partitioned replicated databases," inProc. 5th ACM Symp. Principles of Database Systems, 1986, pp. 240-251.
[14] D. Agrawal and A. E. Abbadi, "Reducing storage for quorum consensus algorithms," inProc. Very Large Databases Conf., 1988, pp. 419-430.
[15] P.A. Bernstein, V. Hadzilacos, and N. Goodman,Concurrency Control and Recovery in Database Systems, Addison-Wesley, Reading, Mass., 1987.
[16] 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.
[17] D. R. Cheriton and W. Zwaenepoel, "Distributed process groups in the V kernel,"ACM Trans. Comput. Syst., vol. 3, no. 2, pp. 77-107, May 1985.
[18] M. Ahamad, M. H. Ammar, and S. Y. Cheung, "Multi-dimensional voting,"ACM Trans. Computer Syst., vol. 9, pp. 399-431, Nov 1991.
[19] Z. Tong and R. Kain, "Vote assignments in weighted voting mechanisms," inProc. 7th Symp. Reliable Distributed Syst., 1988, pp. 138-143.
[20] R. Agrawal, M. J. Carey, and M. Livny, "Models for studying concurrency control performance: Alternatives and implications,"ACM SIGMOD Int. Conf. Management of Data, 1985, pp. 108-121.
[21] M. J. Carey and M. Livny, "Distributed concurrency control performance: A study of algorithms, distribution, and replication," inProc. 14th Int. Conf. Very Large Data Bases, 1988.