liveBook · Manning

Quorum compounding

As explained in Latency

Quorum compounding is a parallel execution pattern in which completion requires responses from a majority rather than all participating components.

Quorum compounding is a parallel execution pattern where components run concurrently, but completion requires responses from a majority rather than every participant. For N nodes, the quorum is (N/2) + 1. section 2.4

Cluster quorum

A three-node cluster needs two responses; a five-node cluster needs three. Raft, Paxos, and Viewstamped Replication use majority agreement to reach consensus while avoiding the latency of waiting for every node. section 2.4

Use quorum compounding to reason about parallel latency and completion conditions:

  • Parallel execution can still encounter tail latency as fan-out increases. section 2.4
  • Waiting only for a quorum can optimize latency because slower minority responses are unnecessary. section 2.4

How Latency covers it

How deep it goes
Defines quorum sizes and latency implications, but defers consensus algorithms and measurement details.
Examples
Uses three-node and five-node clusters plus Raft, Paxos, and Viewstamped Replication as concrete examples.
What it assumes
Assumes familiarity with parallel compounding, fan-out, and latency variability.
What you can do after
Evaluate parallel latency strategies by calculating quorum requirements and identifying when minority responses can be ignored.
How it connects
Connects quorum compounding to parallel compounding, tail latency, distributed consensus, and strong consistency.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Latency. The section links point to the parts of the book it draws on.