Content deleted Content added
Removed false statements. This includes the whole description of the protocol which seems like original research and is unsound (none of the cited sources match the description). Also removed the claim that 3PC "places an upper bound on the time required before a transaction either commits or aborts". This is theoretically impossible. |
Alter: journal. | You can use this tool yourself. Report bugs here. | via #UCB_Gadget |
||
Line 14:
==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|author2=Danny Dolev |title=Increasing the Resilience of Distributed and Replicated Database Systems|journal= Journal of Computer and System Sciences
url=http://webee.technion.ac.il/~idish/Abstracts/jcss.html|doi=10.1006/jcss.1998.1566}}</ref> refines Skeen's three-phase commit protocol and solves this problem in a way which *always* allows a quorum to make progress.
| |||