Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article

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

Published: 01 June 2002 Publication History

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.
[2]
Eric A. Brewer. Towards robust distributed systems. (Invited Talk) Principles of Distributed Computing, Portland, Oregon, July 2000.
[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.
[4]
Leslie Lamport. On interprocess communication --- parts I and II. Distributed Computing, 1(2):77-101, April 1986.
[5]
Nancy Lynch. Distributed Algorithms. Morgan Kaufman, 1996.

Cited By

View all
  • (2024)Formal Verification of Consistency for Systems with Redundant ControllersElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.399.8399(169-191)Online publication date: 27-Mar-2024
  • (2024)Horizontally Scalable Implementation of a Distributed DBMS Delivering Causal Consistency via the Actor ModelElectronics10.3390/electronics1317336713:17(3367)Online publication date: 24-Aug-2024
  • (2024)An ICN-Based On-Path Computing Resource Scheduling Architecture with User Preference Awareness for Computing NetworkElectronics10.3390/electronics1305093313:5(933)Online publication date: 29-Feb-2024
  • Show More Cited By

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

    Information & Contributors

    Information

    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

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 June 2002
    Published in SIGACT Volume 33, Issue 2

    Check for updates

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)514
    • Downloads (Last 6 weeks)39
    Reflects downloads up to 30 Aug 2024

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Formal Verification of Consistency for Systems with Redundant ControllersElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.399.8399(169-191)Online publication date: 27-Mar-2024
    • (2024)Horizontally Scalable Implementation of a Distributed DBMS Delivering Causal Consistency via the Actor ModelElectronics10.3390/electronics1317336713:17(3367)Online publication date: 24-Aug-2024
    • (2024)An ICN-Based On-Path Computing Resource Scheduling Architecture with User Preference Awareness for Computing NetworkElectronics10.3390/electronics1305093313:5(933)Online publication date: 29-Feb-2024
    • (2024)Blockchains: Fusing Platform Functionalities Under the CAP TradeoffSSRN Electronic Journal10.2139/ssrn.4748826Online publication date: 2024
    • (2024)Asynchrony-Resilient Sleepy Total-Order Broadcast ProtocolsProceedings of the 43rd ACM Symposium on Principles of Distributed Computing10.1145/3662158.3662779(247-256)Online publication date: 17-Jun-2024
    • (2024)IsoPredict: Dynamic Predictive Analysis for Detecting Unserializable Behaviors in Weakly Isolated Data Store ApplicationsProceedings of the ACM on Programming Languages10.1145/36563918:PLDI(343-367)Online publication date: 20-Jun-2024
    • (2024)NOC-NOC: Towards Performance-optimal Distributed TransactionsProceedings of the ACM on Management of Data10.1145/36392642:1(1-25)Online publication date: 26-Mar-2024
    • (2024)GBT-CHAIN: A System Framework for Solving the General Trilemma in Permissioned BlockchainsDistributed Ledger Technologies: Research and Practice10.1145/36158713:2(1-15)Online publication date: 18-Jun-2024
    • (2024)Unsealing the secrets of blockchain consensus: A systematic comparison of the formal security of proof-of-work and proof-of-stakeProceedings of the 39th ACM/SIGAPP Symposium on Applied Computing10.1145/3605098.3635970(278-287)Online publication date: 8-Apr-2024
    • (2024)MIS: A Multi-Identifier Management and Resolution System in the MetaverseACM Transactions on Multimedia Computing, Communications, and Applications10.1145/359764120:7(1-25)Online publication date: 27-Mar-2024
    • Show More Cited By

    View Options

    Get Access

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media