Reliability mechanisms for SDD-1: a system for distributed databases
ACM Transactions on Database Systems (TODS)
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
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Distributed Systems - Architecture and Implementation, An Advanced Course
Polynomial algorithms for multiple processor agreement
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Computation & communication in R: a distributed database manager
SOSP '83 Proceedings of the ninth ACM symposium on Operating systems principles
Efficient commit protocols for the tree of processes model of distributed transactions
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Transaction management in the R* distributed database management system
ACM Transactions on Database Systems (TODS)
Recovery management in QuickSilver
ACM Transactions on Computer Systems (TOCS)
Reliability mechanisms for ADAMS
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Distributed Checkpointing for Globally Consistent States of Databases
IEEE Transactions on Software Engineering
A Distributed Commit Protocol for a Multicomputer System
IEEE Transactions on Computers
Open commit protocols tolerating commission failures
ACM Transactions on Database Systems (TODS)
Closure and Convergence: A Foundation of Fault-Tolerant Computing
IEEE Transactions on Software Engineering - Special issue on software reliability
Design of fault tolerant distributed systems: the fail-controlled approach
EW 4 Proceedings of the 4th workshop on ACM SIGOPS European workshop
Election in Asynchronous Complete Networks with Intermittent Link Failures
IEEE Transactions on Computers
An Adaptive Checkpointing Scheme for Distributed Databases with Mixed Types of Transactions
IEEE Transactions on Knowledge and Data Engineering
Efficient commit protocols for the tree of processes model of distributed transactions
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Asynchronous Byzantine consensus
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Efficient commit protocols for the tree of processes model of distributed transactions
ACM SIGOPS Operating Systems Review
Common knowledge and consistent simultaneous coordination
Distributed Computing
Consensus on transaction commit
ACM Transactions on Database Systems (TODS)
Specifying and using intrusion masking models to process distributed operations
Journal of Computer Security
Byzantine Fault Tolerant Coordination for Web Services Atomic Transactions
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Augustus: scalable and robust storage for cloud applications
Proceedings of the 8th ACM European Conference on Computer Systems
| Hi-index | 0.01 |
This paper describes an application of Byzantine Agreement [DoSt82a, DoSt82c, LyFF82] to distributed transaction commit. We replace the second phase of one of the commit algorithms of [MoLi83] with Byzantine Agreement, providing certain trade-offs and advantages at the time of commit and providing speed advantages at the time of recovery from failure. The present work differs from that presented in [DoSt82b] by increasing the scope (handling a general tree of processes, and multi-cluster transactions) and by providing an explicit set of recovery algorithms. We also provide a model for classifying failures that allows comparisons to be made among various proposed distributed commit algorithms. The context for our work is the Highly Available Systems project at the IBM San Jose Research Laboratory [AAFKM83].