Skip to main content
SpringerLink
Log in

Atomic updates of replicated data

  • Session 8 Replication and Distribution
  • Conference paper
  • First Online:
Dependable Computing — EDCC-2 (EDCC 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1150))

Included in the following conference series:

Abstract

Although several replication strategies have been described and compared in the literature, very few work has been published on the underlying protocols needed to support these strategies. In fact, the classical transactional protocols that are usually assumed are not fault-tolerant, and thus create a window of vulnerability for the “faulttolerant” strategies they intend to support. In this paper, we point out this issue for “quorum voting” replication strategies. We describe a faulttolerant protocol that enables to adequately support these strategies. We present some performance figures showing that, in addition to its higher resilience, our protocol provides better performance than the other possible alternatives.

Research supported by the “Fonds national suisse” under contract number 21-43196.95

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P.A. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison Wesley. 1987.

    Google Scholar 

  2. T. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 34(1), pp 225–267, March 1996. A preliminary version appeared in Proceedings of the 10th ACM Symposium on Principles of Distributed Computing, pp 325–340. ACM Press. August 1991.

    Google Scholar 

  3. T. Chandra, V. Hadzilacos and S. Toueg. The weakest failure detector for solving consensus. Journal of the ACM, 43(4), July 1996. A preliminary version appeared in Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, pp 147–159. ACM Press. August 1992.

    Google Scholar 

  4. S. Ceri, M. Houstsma, A. Keller and P. Samarati. A Classification of Update Methods for Replicated Databases. Technical Report CS-TR-91-1392, Department of Computer Science, Stanford Univ, 1991.

    Google Scholar 

  5. S-W. Chen and C. Pu. A Structural Classification of Integrated Replica Control Mechanisms. Technical Report CUCS-006-92, Department of Computer Science, Columbia University, 1992.

    Google Scholar 

  6. K. Goldman and N. Lynch. Quorum Consensus in Nested Transaction Systems. In ACM Transactions on Database Systems 19 (4), pp 537–587. December 1994.

    Google Scholar 

  7. D. K. Gifford. Wheighted Voting for Replicated Data. In Proceeding of the 7th ACM Symposium on Operating System Principles, pp 150–161. ACM Press. 1979.

    Google Scholar 

  8. R. Guerraoui, M. Larrea and A. Schiper. Reducing the Cost of Non-Blocking in Atomic Commitment. Proceedings of the 16th IEEE International Conference on Distributed Computing Systems, pp 691–697, May 1996.

    Google Scholar 

  9. J. Gray. Notes on Database Operating Systems. In Operating Systems: An Advanced Course, pp 10–17. Lecture Notes in Computer Science (60), Springer Verlag. 1978.

    Google Scholar 

  10. S. Jajodia and D. Mutchler. Dynamic voting algorithms for maintainning the consistency of replicated databases. In ACM Transactions on Database Systems 15, pp 230–280. June 1990.

    Google Scholar 

  11. J.-F. Pâris. Voting with Witnesses: A Consistency Scheme for Replicated Files. In Proceedings of the 6th IEEE International Conference on Distributed Computing Systems, pp 606–612. 1986.

    Google Scholar 

  12. D. Skeen. NonBlocking Commit Protocols. In Proceedings of the ACM SIGMOD International Conference on Management of Data, pp 133–142. ACM Press. 1981.

    Google Scholar 

  13. D. Skeen. A Quorum-Based Commit Protocol. In Proceedings of the Berkeley Workshop on Distributed Data Management and Computer Networks (6), pp 69–80. February 1982.

    Google Scholar 

  14. R. van Renesse and A. Tanenbaum. Voting with Ghosts. In Proceedings of the 8th IEEE International Conference on Distributed Computing Systems, pp 456–462. June 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Département d'Informatique, Ecole Polytechnique Fédérale de Lausanne, 1015, Lausanne, Switzerland

    Rachid Guerraoui, Rui Oliveira & André Schiper

Authors
  1. Rachid Guerraoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rui Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. André Schiper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrzej Hlawiczka João Gabriel Silva Luca Simoncini

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Guerraoui, R., Oliveira, R., Schiper, A. (1996). Atomic updates of replicated data. In: Hlawiczka, A., Silva, J.G., Simoncini, L. (eds) Dependable Computing — EDCC-2. EDCC 1996. Lecture Notes in Computer Science, vol 1150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61772-8_49

Download citation

  • DOI: https://doi.org/10.1007/3-540-61772-8_49

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61772-3

  • Online ISBN: 978-3-540-70677-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation