skip to main content
article

Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services

Authors Info & Claims
Published:01 June 2002Publication History
Skip Abstract Section

Abstract

When designing distributed web services, there are three properties that are commonly desired: consistency, availability, and partition tolerance. It is impossible to achieve all three. In this note, we prove this conjecture in the asynchronous network model, and then discuss solutions to this dilemma in the partially synchronous model.

References

  1. Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, and Rüdiger Reischuk. Achievable cases in an asynchronous environment. In 28th Annual Symposium on Foundations of Computer Science, pages 337-346, Los Angeles, California, October 1987.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Eric A. Brewer. Towards robust distributed systems. (Invited Talk) Principles of Distributed Computing, Portland, Oregon, July 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Maurice P. Herlihy and Jeannette M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3):463-492, July 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Leslie Lamport. On interprocess communication --- parts I and II. Distributed Computing, 1(2):77-101, April 1986.Google ScholarGoogle ScholarCross RefCross Ref
  5. Nancy Lynch. Distributed Algorithms. Morgan Kaufman, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services
    Index terms have been assigned to the content through auto-classification.

    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 ACM SIGACT News
      ACM SIGACT News  Volume 33, Issue 2
      June 2002
      79 pages
      ISSN:0163-5700
      DOI:10.1145/564585
      Issue’s Table of Contents

      Copyright © 2002 Authors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 June 2002

      Check for updates

      Qualifiers

      • article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader