A More Committed Quorum-Based Three Phase Commit Protocol

@inproceedings{Kempster1998AMC,
  title={A More Committed Quorum-Based Three Phase Commit Protocol},
  author={Tim Kempster and Colin Stirling and Peter Thanisch},
  booktitle={DISC},
  year={1998}
}
In the original quorum-based three phase commit (Q3PC) protocol, a quorum of sites may form after failure, yet those sites remain blocked. [...] Key Method We use the concept of “views” to analyse protocols. This allows us to construct an improved version of E3PC which can make progress towards committing a transaction during recovery in circumstances where E3PC would abort. Our new protocol shares with E3PC the property that a quorum never blocks.Expand
Adapting Distributed Commit Protocol for Dynamic Metacomputing Frameworks
With increasing interest in applications which benefit from distributed computing paradigm and require at the same time to operate on data from heterogeneous data sources there is an increasingExpand
Adapting Commit Protocols for Large-Scale and Dynamic Distributed Applications
TLDR
This paper presents an adaptation of three-phase commit protocol for dynamic and scalable distributed systems and offers a set of adjustable parameters for a desired level of consistency at lowest cost depending on specific requirements of different applications. Expand
Modelling, analysing and model checking commit protocols
TLDR
It is demonstrated that this modelling technique is flexible and formal enough to support automatic verification of behavioural properties of commit protocols, using tools such as model checking as well as more traditional proof techniques. Expand
Games-Based Model Checking of Protocols: counting doesn't count
TLDR
A technique that can be used to model the behaviour of protocols by modeling the popular two-phase commit protocol and providing evidence to verify or refute the property being checked using a games based model checking algorithm. Expand
A Transactional Approach to Configuring Telecommunications Services
TLDR
This work demonstrates how atomic commit protocols have already been developed for achieving atomicity in distributed transaction processing can be transferred to network configuration management and examines the ways in whichatomic commit protocols can benefit from new telecommunications services. Expand
Modeling and Model Checking Mobile Phone Payment Systems
TLDR
This work presents a formal model of these novel transactions using a views based modeling technique and shows how to express two safety properties namely goods and money atomicity within this model using a sub-logic of CTL. Expand

References

SHOWING 1-7 OF 7 REFERENCES
Increasing the resilience of atomic commit, at no additional cost
TLDR
A new atomic commitment protocol that always allows a quorum in the system to make progress, and is demonstrated, using a simple algorithm, how protocols that always allow a majority to makeProgress can be constructed. Expand
A Quorum-Based Commit Protocol
  • D. Skeen
  • Computer Science
  • Berkeley Workshop
  • 1982
TLDR
A commit protocol and an associated recovery protocol that is resilient to site failures, lost messages, and network partitioning and facilitates the integration of these protocols with concurrency control protocols. Expand
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
TLDR
This paper confirms that NB-AC is harder than Consensus, and shows actually that any algorithm that solves Consensus with unreliable failure detectors also solves Uniform Consensus. Expand
Failure detectors in omission failure environments
TLDR
A weak failure detector ><W(om) is defined that allows any majority of the processes that become connected to reach a Consensus decision, despite any number of transient communication failures in their past. Expand
Unreliable failure detectors for reliable distributed systems
TLDR
It is proved that Consensus and Atomic Broadcast are reducible to each other in asynchronous systems with crash failures; thus, the above results also apply to Atomic Broadcast. Expand
Elections in a Distributed Computing System
TLDR
This paper discusses elections and reorganizations of active nodes in a distributed computing system after a failure, and two types of reasonable failure environments are studied. Expand
A Quorum Based Commit Protocol. Berkeley Workshop on Distributed Data Management and Computer Networks
  • A Quorum Based Commit Protocol. Berkeley Workshop on Distributed Data Management and Computer Networks
  • 1982