Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services.

Gilbert, S., & Lynch, N. (2002). Brewer's Conjecture and the Feasibility of Consistent, Available, Partition-Tolerant Web Services. ACM SIGACT News, 33(2), 51-59.

Type

Journal article

Intellectual base

Primary research

Year

2002

DOI

10.1145/564585.564601

Link

https://doi.org/10.1145/564585.564601

Cited from

computer_science, economics_finance, mathematics, synthesized, systems_cybernetics

Cited by

6 citations across 6 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Axiomatic Incompatibility
  • In distributed systems, the CAP theorem rules out consistency, availability, and partition-tolerance jointly under partition, and FLP rules out deterministic asynchronous consensus tolerating even one crash.
• Consistency Model
  • They interact (partitions force consistency/availability trade-offs

    This sourceProves the CAP theorem: under network partition a system must trade consistency against availability.

• Inconsistent Shared Model
  • The uncoupled inference channel is now literal: the replication link between A and B is severed, so each continues to apply writes and update its own internally consistent model with no way to compare against the other.

    This sourceFormal proof of the CAP theorem; the consistency/availability menu (CP refuse writes vs AP accept divergence and reconcile) is the set of pre-declared responses to split-brain divergence under partition.

• Trade-offs
  • - Computer science and information systems
• Trilemma
  • The three named desirables are consistency (every read returns the most recent write), availability (every request receives a non-error response), and partition tolerance (the system continues operating despite dropped messages between nodes).

    This sourceFormal proof of the CAP theorem — consistency, availability, and partition tolerance cannot all be guaranteed in an asynchronous network.

Domain-specific

• Distributed Data Store
  • Gilbert and Lynch show that an asynchronous read/write service cannot guarantee atomic consistency, availability, and tolerance of arbitrary message loss simultaneously.

Verification

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

Registry ID ref:5298f3b70ae1 · see in the full table