Construct · 1 fields · 1 citations

Byzantine quorum system: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Distributed systems

a family of quorums whose pairwise intersections are large enough to mask a bounded number of arbitrarily faulty servers in replicated data.

In distributed systems, Byzantine quorum system refers to a family of quorums whose pairwise intersections are large enough to mask a bounded number of arbitrarily faulty servers in replicated data. This meaning comes from Malkhi (1998) in Distributed Computing.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how Byzantine quorum system sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

family3 fields · 3 citationsjingle · one word, three constructs mask3 fields · 3 citationsjingle · one word, three constructs number3 fields · 6 citationsjingle · one word, three constructs

References

Malkhi, D., & Reiter, M. (1998). Byzantine quorum systems. Distributed Computing, 11(4), 203-213. https://doi.org/10.1007/s004460050050

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct