Results 1 -
2 of
2
Efficient commit protocols for the tree of processes model of distributed transactions
- Proc. 2nd ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing
, 1983
"... ABSTRACT: This paper describes two efficient distributed transaction commit protocols, the ..."
Abstract
-
Cited by 35 (3 self)
- Add to MetaCart
ABSTRACT: This paper describes two efficient distributed transaction commit protocols, the
Method for Distributed Transaction Commit and Recovery Using Byzantine Agreement Within Clusters of Processors
- In Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing
, 1983
"... 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 th ..."
Abstract
-
Cited by 21 (2 self)
- Add to MetaCart
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 (handing 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 [AAF-KM83].
