Transaction management in the R* distributed database management system
ACM Transactions on Database Systems (TODS)
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Increasing the resilience of atomic commit, at no additional cost
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Revisiting commit processing in distributed database systems
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
Non-blocking atomic commitment
Distributed systems (2nd Ed.)
Building Secure and Reliable Network Applications
Building Secure and Reliable Network Applications
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
Scalable Replication in Database Clusters
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
The inherent cost of nonblocking commitment
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
The Decentralized Non-Blocking Atomic Commitment Protocol
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Non blocking atomic commitment with an unreliable failure detector
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
Reducing the cost for non-blocking in atomic commitment
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Processing Transactions over Optimistic Atomic Broadcast Protocols
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
A Single Phase Distributed Commit Protocol for Main Memory Database Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Comparison of Database Replication Techniques Based on Total Order Broadcast
IEEE Transactions on Knowledge and Data Engineering
Unification of Transactions and Replication in Three-Tier Architectures Based on CORBA
IEEE Transactions on Dependable and Secure Computing
MIDDLE-R: Consistent database replication at the middleware level
ACM Transactions on Computer Systems (TOCS)
Selective data replication for distributed geographical data sets
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
The circular two-phase commit protocol
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Open questions on consensus performance in well-behaved runs
Future directions in distributed computing
Towards robust optimistic approaches
Future directions in distributed computing
Transaction manager failover: a case study using JBOSS application server
OTM'06 Proceedings of the 2006 international conference on On the Move to Meaningful Internet Systems: AWeSOMe, CAMS, COMINF, IS, KSinBIT, MIOS-CIAO, MONET - Volume Part II
| Hi-index | 0.00 |
Atomic commitment is one of the key functionalities of modern information systems. Conventional distributed databases, transaction processing monitors, or distributed object platforms are examples of complex systems built around atomic commitment. The vast majority of such products implement atomic commitment using some variation of 2 Phase Commit (2PC) although 2PC may block under certain conditions. The alternative would be to use non-blocking protocols but these are seen as too heavy and slow. In this paper we propose a nonblocking distributed commit protocol that exhibits the same latency as 2PC. The protocol combines several ideas (optimism and replication) to implement a scalable solution that can be used in a wide range of applications.