hesela.devPartial quorum
A partial quorum configuration allows a read response set and a write acknowledgement set that need not overlap.
With uniform R- and W-member subsets of the same N replicas, non-intersection has probability C(N-W,R)/C(N,R); missing all k recent writes raises it to the kth power only under independent write selections. [1] Partial concerns overlap, whereas sloppy quorum concerns fallback membership. [2]
Relations
- related
- quorum-intersection, sloppy-quorum
Limitations
- This sampling model is not a production stale-read rate or a deterministic time bound. [1]