Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processors
Method for distributed transaction commit and recovery using Byzantine Agreement within clusters of processors
复制标题
在处理器集群内使用拜占庭协议的分布式事务提交和恢复的方法
DOI：
10.1145/850776.850779
复制
发表时间：
1985
期刊：
影响因子：
--
通讯作者：
Sheldon J. Finkelstein
中科院分区：
文献类型：
--
作者：
C. Mohan;H. Strong;Sheldon J. Finkelstein
本文描述了Byzantine协议[DoSt 82 a，DoSt 82 e，LyFF 82]在分布式事务提交中的应用。我们将[MoLi 83]的一个提交算法的第二阶段替换为拜占庭协议，在提交时提供某些权衡和优势，并在从故障恢复时提供速度优势。目前的工作与[DoSt 82 b]中提出的不同之处在于增加了范围（处理一般的进程树和多集群事务），并提供了一组明确的恢复算法。我们还提供了一个模型进行分类的失败，允许各种建议的分布式提交算法之间进行比较。我们工作的背景是IBM圣何塞研究实验室的高可用系统项目[AAF-KM 83]。
This paper describes an application of Byzantine Agreement [DoSt82a, DoSt82e, 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 [AAF-KM83].