skip to main content
research-article
Free Access

Eventually consistent

Published:01 January 2009Publication History
Skip Abstract Section

Abstract

Building reliable distributed systems at a worldwide scale demands trade-offs between consistency and availability.

References

  1. Brewer, E.A. Towards robust distributed systems (abstract). In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (July 16--19, 2000, Portland, OR), 7. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Conversation with Bruce Lindsay. ACM Queue 2, 8 (2004), 22--33. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. DeCandia, G., et. al. Dynamo: Amazon's highly available key-value store. In Proceedings of the 21st ACM Symposium on Operating Systems Principles (Stevenson, WA, Oct. 2007). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Gilbert, S. and Lynch, N. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant Web services. ACM SIGACT News 33, 2 (2002). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Lindsay, B.G. et al. Notes on distributed databases. Distributed Data Bases. I.W. Draffan and F. Poole, Eds. Cambridge University Press, Cambridge, MA, 1980, 247--284. Also available as IBM Research Report RJ2517, San Jose, CA (July 1979).Google ScholarGoogle Scholar

Index Terms

  1. Eventually consistent

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image Communications of the ACM
          Communications of the ACM  Volume 52, Issue 1
          Rural engineering development
          January 2009
          125 pages
          ISSN:0001-0782
          EISSN:1557-7317
          DOI:10.1145/1435417
          Issue’s Table of Contents

          Copyright © 2009 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 1 January 2009

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Popular
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format