Three-phase commit protocol: Difference between revisions

Revision as of 09:16, 4 July 2023

Latest revision as of 20:34, 14 December 2024

(7 intermediate revisions by 5 users not shown)

Line 1:

{{Short description|Distributed algorithm}}

In [[computer networking]] and distributed [[database]]s, the '''three-phase commit protocol''' ('''3PC''')<ref name=3PC>{{cite techreporttech report

| last = Skeen

| first = Dale

Line 7:

| institution = Department of Computer Science, Cornell University

| url = https://ecommons.cornell.edu/handle/1813/6323

}}</ref> is a [[distributed algorithm]] whichthat letsensures all nodes in a [[distributed system|system]] agree to [[Commit (data management)|commit]] or abort a [[database transaction|transaction]]. It isimproves a more failure-resilient refinement ofupon the [[two-phase commit protocol]] (2PC) by eliminating the possibility of indefinite blocking caused by a specific type of failure during the commit phase.

==Motivation==

Line 19:

==Extensions==

Using Skeen's original three-phase commit protocol, it is possible that a quorum becomes connected without being able to make progress (this is not a deadlock situation; the system will still progress if the network partitioning is resolved). Keidar and Dolev's E3PC<ref name=E3PC>{{cite journal|last=Keidar|first=Idit|author1-link=Idit Keidar|author2=Danny Dolev |title=Increasing the Resilience of Distributed and Replicated Database Systems|journal= Journal of Computer and System Sciences|volume=57|issue=3|date=December 1998|pages=309–324|

url=httphttps://webeeiditkeidar.technion.ac.ilcom/wp-content/uploads/~idishfiles/Abstracts/jcss.html|doi=10.1006/jcss.1998.1566|doi-access=free}}</ref> refines Skeen's three-phase commit protocol and solves this problem in a way which ''always'' allows a quorum to make progress.

==Disadvantages==

Line 30:

==See also==

*[[Two-phase commit protocol]]

*[[Paxos algorithm]]

[[Category:Transaction processing]]