Live briefing
Everything about Three-phase commit protocol
Distributed algorithm
In computer networking and distributed databases, the three-phase commit protocol (3PC) is a distributed algorithm that ensures all nodes in a system agree to commit or abort a transaction. It improves upon the two-phase commit protocol (2PC) by eliminating the possibility of indefinite blocking caused by a specific type of failure during the commit phase. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Three-phase commit protocolA 5-minute orientation
- Pick up a classic book: Data Communications and NetworkingThe most-reprinted book on the subject
- Read the landmark paper: A SNAP-Based Community Resource Broker Using a Three-Phase Commit Protocol: A Performance StudyCited 14 times
- Go sideways: Two-phase commit protocolA closely related topic
- Go sideways: Atomic commitA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Data Communications and NetworkingBehrouz A. Forouzan, Catherine Ann Coombs · 2000
The Conspirators HierarchyJohn Coleman · 1992
Treaty Occupationay ToxicologySuelen Queiroz · 2010
The Human Planet · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- 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)…
- Atomic commit In the field of computer science, an atomic commit is an operation that applies a set of distinct changes as a single operation. If the changes are applied…
- 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…
- Quorum (distributed computing) 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…
- Commitment ordering Commitment ordering (CO) is a class of interoperable serializability techniques in concurrency control of databases, transaction processing, and related…
- Paxos (computer science) In computer science, Paxos is a family of protocols for solving consensus in a network of unreliable or fallible processors. Consensus is the process of…
- Gbcast Gbcast (also known as group broadcast) is a reliable multicast protocol that provides ordered, fault-tolerant (all-or-none) message delivery in a group…
- X/Open XA For transaction processing in computing, the X/Open XA standard (short for "eXtended Architecture") is a specification released in 1991 by X/Open (which…