Live briefing
Everything about Quorum (distributed computing)
Minimum number of votes that a distributed transaction has to obtain
A quorum is the minimum number of votes that a distributed transaction has to obtain in order to be allowed to perform an operation in a distributed system. A quorum-based technique is implemented to enforce consistent operation in a distributed system. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Quorum (distributed computing)A 5-minute orientation
- Pick up a classic book: Cooperative task-oriented computingThe most-reprinted book on the subject
- Go sideways: Concurrency controlA closely related topic
- Go sideways: Commitment orderingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
- No matching papers found.
📚 Books worth reading
Cooperative task-oriented computingChryssis Georgiou · 2011
Database replicationBettina Kemme · 2010- 📕Proceedings of the Twenty-Second Annual ACM Symposium on Principles of Distributed ComputingMass.) ACM Symposium on Principles of Distributed Computing (22nd 2003 Boston · 2003
- 📕PODC 2006Colo.) ACM Symposium on Principles of Distributed Computing (25th 2006 Denver · 2006
BIOINFORMATICS ALGORITHMS,VOL.IIPhillip Compeau, Pavel Pevzner · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Concurrency control In information technology and computer science, especially in the fields of computer programming, operating systems, multiprocessors, and databases, concurrency…
- Commitment ordering Commitment ordering (CO) is a class of interoperable serializability techniques in concurrency control of databases, transaction processing, and related…
- ACID In computer science, ACID (atomicity, consistency, isolation, durability) is a set of properties of database transactions intended to guarantee data validity…
- Replication (computing) Replication in computing refers to maintain multiple copies of data, processes, or resources to ensure consistency across redundant components. This fundamental…
- Two-phase commit protocol In transaction processing, databases, and computer networking, the two-phase commit protocol (2PC, tupac) is a type of atomic commitment protocol (ACP)…
- Three-phase commit protocol In computer networking and distributed databases, the three-phase commit protocol (3PC) is a distributed algorithm that ensures all nodes in a system agree…
- Online transaction processing Online transaction processing (OLTP) is a type of database system used in transaction-oriented applications, such as many operational systems. The term…
- Commit (data management) In computer science and data management, a commit is a behavior that marks the end of a transaction and provides Atomicity, Consistency, Isolation, and…