Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processors
C. Mohan, Ray Strong, S. N. Finkelstein · ACM Symposium on Principles of Distributed Computing (PODC) · 1983
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].
Cited by 66 works. doi:10.1145/800221.806712 Open-access PDF
Authors
References
- Reaching Agreement in the Presence of Faults
- Notes on data base operating systems
- Synchronizing clocks in the presence of faults
- Fail-stop processors
- Authenticated Algorithms for Byzantine Agreement
- Polynomial algorithms for multiple processor agreement
- The transaction concept: virtues and limitations
- Reliability mechanisms for SDD-1
- Distributed Systems - Architecture and Implementation: An Advanced Course
- Transaction monitoring in ENCOMPASS: reliable distributed transaction processing