Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
ACM Transactions on Computer Systems (TOCS)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus
WDAG '95 Proceedings of the 9th International Workshop on Distributed Algorithms
How to Build a Highly Available System Using Consensus
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
Revisiting the Paxos Algorithm
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Reducing the cost for non-blocking in atomic commitment
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Sprint: a middleware for high-performance transaction processing
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
XRPC: interoperable and efficient distributed XQuery
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
A distributed coordination protocol in an order-heterogeneous group
International Journal of Web and Grid Services
Is there life outside transactions?: writing the transaction processing book
ACM SIGMOD Record - Tribute to honor Jim Gray
Making an Agreement in an Order-Heterogeneous Group
NBiS '08 Proceedings of the 2nd international conference on Network-Based Information Systems
Self Management for Large-Scale Distributed Systems: An Overview of the SELFMAN Project
Formal Methods for Components and Objects
Blocking reduction for distributed transaction processing within MANETs
Distributed and Parallel Databases
Future Generation Computer Systems
Sinfonia: A new paradigm for building scalable distributed systems
ACM Transactions on Computer Systems (TOCS)
Distributed and Parallel Databases
A protocol for reliably, flexibly, and efficiently making agreement among peers
International Journal of Web and Grid Services
Modelling remote concurrency with Ada: case study of symmetric non-deterministic rendezvous
Ada-Europe'07 Proceedings of the 12th international conference on Reliable software technologies
Consistency without concurrency control in large, dynamic systems
ACM SIGOPS Operating Systems Review
HARC: the highly-available resource co-allocator
OTM'07 Proceedings of the 2007 OTM confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part II
Enhanced Paxos Commit for Transactions on DHTs
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Mencius: building efficient replicated state machines for WANs
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Shepherd: node monitors for fault-tolerant distributed process execution in OSIRIS
Proceedings of the 5th International Workshop on Enhanced Web Service Technologies
Adaptive service migration and transaction processing in wireless sensor networks
Proceedings of the 7th Middleware Doctoral Symposium
Database replication: a tale of research across communities
Proceedings of the VLDB Endowment
Declarative configuration management for complex and dynamic networks
Proceedings of the 6th International COnference
FlurryDB: a dynamically scalable relational database with virtual machine cloning
Proceedings of the 4th Annual International Conference on Systems and Storage
On the design of perturbation-resilient atomic commit protocols for mobile transactions
ACM Transactions on Computer Systems (TOCS)
TMPR-scheme for reliably broadcast messages among peer processes
International Journal of Grid and Utility Computing
CANPRO: a conflict-aware protocol for negotiation of cloud resources and services
ICSOC'11 Proceedings of the 9th international conference on Service-Oriented Computing
Overcoming software fragility with interacting feedback loops and reversible phase transitions
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Spanner: Google's globally-distributed database
OSDI'12 Proceedings of the 10th USENIX conference on Operating Systems Design and Implementation
Beernet: Building Self-Managing Decentralized Systems with Replicated Transactional Storage
International Journal of Adaptive, Resilient and Autonomic Systems
SCORe: a scalable one-copy serializable partial replication protocol
Proceedings of the 13th International Middleware Conference
SWORD: scalable workload-aware data placement for transactional workloads
Proceedings of the 16th International Conference on Extending Database Technology
MDCC: multi-data center consistency
Proceedings of the 8th ACM European Conference on Computer Systems
Spanner: Google’s Globally Distributed Database
ACM Transactions on Computer Systems (TOCS)
OSIRIS-SR: a scalable yet reliable distributed workflow execution engine
Proceedings of the 2nd ACM SIGMOD Workshop on Scalable Workflow Execution Engines and Technologies
Low-latency multi-datacenter databases using replicated commit
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
The distributed transaction commit problem requires reaching agreement on whether a transaction is committed or aborted. The classic Two-Phase Commit protocol blocks if the coordinator fails. Fault-tolerant consensus algorithms also reach agreement, but do not block whenever any majority of the processes are working. The Paxos Commit algorithm runs a Paxos consensus algorithm on the commit/abort decision of each participant to obtain a transaction commit protocol that uses 2F + 1 coordinators and makes progress if at least F + 1 of them are working properly. Paxos Commit has the same stable-storage write delay, and can be implemented to have the same message delay in the fault-free case as Two-Phase Commit, but it uses more messages. The classic Two-Phase Commit algorithm is obtained as the special F = 0 case of the Paxos Commit algorithm.