Early Conflict Checking in Two-Phase Commit Protocol for Replicated State Machines

IF 0.3 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Halit Uyanık, T. Ovatman
{"title":"Early Conflict Checking in Two-Phase Commit Protocol for Replicated State Machines","authors":"Halit Uyanık, T. Ovatman","doi":"10.4018/ijdst.287861","DOIUrl":null,"url":null,"abstract":"Representing an algorithmic workflow as a state machine is a frequently used technique in distributed systems. Replicating a state machine in a fault tolerant way is one of the main application areas under this context. When implementing a replicated state machine, a crucial problem is to maintain consistency among replicas that might handle various different requests arriving at each different replica. This problem requires maintaining a single consistent ordering of the distributed requests handled separately by replicas. Basic consensus protocols such as two phase commit (2PC), can be used to maintain consistency between replicas whenever a request is to be processed. In this study we modify 2PC protocol to take advantage of basic properties of a state machine and detect possible write conflicts earlier. Our experiments on distributed cloud environments show that our modified 2PC protocol increases the throughput and decrease wasted write operations by a significant amount.","PeriodicalId":43267,"journal":{"name":"International Journal of Distributed Systems and Technologies","volume":"12 1","pages":"1-20"},"PeriodicalIF":0.3000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Distributed Systems and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/ijdst.287861","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Representing an algorithmic workflow as a state machine is a frequently used technique in distributed systems. Replicating a state machine in a fault tolerant way is one of the main application areas under this context. When implementing a replicated state machine, a crucial problem is to maintain consistency among replicas that might handle various different requests arriving at each different replica. This problem requires maintaining a single consistent ordering of the distributed requests handled separately by replicas. Basic consensus protocols such as two phase commit (2PC), can be used to maintain consistency between replicas whenever a request is to be processed. In this study we modify 2PC protocol to take advantage of basic properties of a state machine and detect possible write conflicts earlier. Our experiments on distributed cloud environments show that our modified 2PC protocol increases the throughput and decrease wasted write operations by a significant amount.
复制状态机两阶段提交协议中的早期冲突检查
将算法工作流表示为状态机是分布式系统中常用的一种技术。以容错方式复制状态机是这种情况下的主要应用领域之一。在实现复制状态机时,一个关键问题是维护可能处理到达每个不同副本的各种不同请求的副本之间的一致性。这个问题需要维护由副本单独处理的分布式请求的单一一致顺序。基本的共识协议,如两阶段提交(2PC),可用于在处理请求时维护副本之间的一致性。在这项研究中,我们修改了2PC协议,以利用状态机的基本属性,并更早地检测可能的写冲突。我们在分布式云环境上的实验表明,修改后的2PC协议提高了吞吐量,并大大减少了浪费的写操作。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Distributed Systems and Technologies
International Journal of Distributed Systems and Technologies COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
1.60
自引率
9.10%
发文量
64
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信