Software ArchitectureAtlas

Software Architecture Atlas

Gain an overview. Understand the connections.

MechanismChapter II · Distribution · Building block 5 of 6

Quorum

A quorum is the minimum number of replicas that confirm a read or write operation. For a fixed replica set, R + W > N guarantees an overlap of read and write groups.

By Michael Meierhoff · Meierhoff Systems

  1. QuorumSo many replicas have to answer.
  2. OverlappingBoth groups share at least one replica.
  3. R + W > NThis calculation shows the overlap.

Context

Why this is important

For multiple replicas, the number of confirmations determines whether a read can touch the last write at all. Incorrectly selected values provide outdated statuses without visible errors. Replication and consensus deepen your own building blocks.

This building block explains replica majorities and their overlap. Conflict resolution and binding order additionally depend on versioning and protocol.

At a glance · Write and read quorum at N = 3

A write operation is considered successful as soon as W = 2 from 3 Confirm replicas; read at R = 2 always meets at least one current one.
Shop example · Calculate the quorum

Reading and writing quorum of cart storage

A distributed shopping cart storage uses three replicas. The team uses two confirmations for reading and writing and sees how the groups overlap.

This is how you read the picture

  1. Quorum You set R Read Confirmations and W Write Confirmations of N replicas.
  2. Overlapping The circles that lie in the reading and writing group are highlighted.
  3. R + W > N The formula shows live whether the sum is greater than N.
  1. Replicate 1, writes
  2. Replicate 2, writes, is read
  3. Replicate 3, is read

Wrong type WReading group ROverlapping

R + W = 4 > N = 3Each reading group meets at least one replica with the latest writing status.4 > 3: at least one common replica

Select N, R and W or a preset. Check if the read and write group overlap (R + W > N).

Benefits & limitations

Helps if:

  • Read and write groups from several replicas benefit from a defined minimum overlap.
  • A defined number of reachable acknowledgements makes the fault tolerance of an operation explicit.
  • Concurrent writes need suitable versioning and conflict rules alongside quorum counts.

Boundaries

  • If the number of reachable replicas falls below W or R, the operation fails or waits; define this behaviour.
  • R + W > N applies only to the same replica set; separate regional groups with independent counts do not automatically overlap.
  • Overlap establishes a shared replica, not the latest value; versions and Consensus order concurrent writes.

In practice

  1. Count N, R and W for the same replica group and failure domain. Document which sets of reachable nodes can meet the threshold and allow operation to continue.
  2. Check read–write group overlap using R + W > N. Add a separate rule for versions and concurrent changes.
  3. Test node failures, conflicts and repair using the actual configuration. Replication explains copies; Consensus ensures a shared log order.
Read the detailed explanation

A quorum requires a minimum number of replicas to acknowledge a write or provide a read response. With N replicas, read and write groups mathematically overlap when R + W > N.

This overlap establishes that read and write groups share at least one replica. An authoritative order for concurrent writes and linearisability depend on additional protocol properties. Replica sets, regions, versioning and conflict rules determine the scope of the guarantee.

Replication maintains multiple data copies; Consensus makes participants agree on an authoritative log state. Conflict resolution and versioning require additional rules that fit the quorum strategy.

Check your understanding

Test yourself in three stages

  1. ReadingCheck in the picture

    Which preset does not have computational overlap, and why?

    View the solution with justification

    B: R + W = 1 + 2 = 3 is not greater than N = 3. The groups can meet different replicas.

  2. ApplyingTransferred to a new situation

    The shop has three replicas and requires three write confirmations. How many reading confirmations are mathematically sufficient for an overlap?

    View the solution with justification

    One. With R = 1 and W = 3 Applicable 4 > 3. Whether the read value is the latest also determines protocol and versioning.

  3. EvaluateWeighing an alternative

    For three replicates instead of W = 2 now W = 3 What speaks for it, what speaks against it?

    View the solution with justification

    For this: Reading comes with a confirmation. On the other hand, each write operation requires all three replicas and can no longer be confirmed in the event of a failure.

Explore further

These building blocks continue the thoughts of this page.

DataReplicationHere you learn how data replicas work together and what consequences stale updates have.Opening DistributionConsensusConsensus brings distributed participants to a common order of committed changes.Opening DataConsistency modelsConsistency models define when changes become visible and the order in which they appear.Opening

References

Continue on the learning path

Next in Distributed systems: Consensus.

6 Building blocks

Continue withConsensus