RC-OCP: Reverse coordinated optimized commit protocol

G. Chauhan, M. K. Gupta, A. Khunteta
{"title":"RC-OCP: Reverse coordinated optimized commit protocol","authors":"G. Chauhan, M. K. Gupta, A. Khunteta","doi":"10.1109/ICISCON.2014.6965224","DOIUrl":null,"url":null,"abstract":"With the growth of trends in computing and requirement for developing a reliable computing environment the need for performing tasks in distributed manner has gained much importance. Atomic commit protocols (ACP) are used to preserve the ACID property in distributed systems. Two-Phase Commit (2PC) is most widely used but the blocking of sites is undesirable as these sites may be holding locks on the resources. As alternative, non-blocking ACP has been suggested: This nonblocking protocol is Three-Phase Commit (3PC) protocol which requires an extra phase (pre-commit) to remove blocking state. The existing protocols require so many messages transfer from the coordinator to participants and vice versa during different phases and corresponding increase communication and time complexity and hold the locks acquire by different participants till the end of last phase, forcing other transactions also to be blocked just because of the objects that are locked. All the existing protocols give the same performance for both deferred and immediate consistency constraints databases. Lots of protocols are being proposed and mainly the concentration was to make the 2PC protocol non-blocking or to minimize the blocking possibilities in 2PC. There has been a renewed interest in developing and optimization of more efficient ACPs. This paper is an effort to propose a new technique to optimize atomic commit protocols by optimizing voting phase based on deferred and immediate consistency constraints. Also an attempt has been made to propose reduction in communication complexity which will require less number of messages to be shared between coordinator and participants, the cost of execution as well as time delays.","PeriodicalId":193007,"journal":{"name":"2014 International Conference on Information Systems and Computer Networks (ISCON)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 International Conference on Information Systems and Computer Networks (ISCON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISCON.2014.6965224","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

With the growth of trends in computing and requirement for developing a reliable computing environment the need for performing tasks in distributed manner has gained much importance. Atomic commit protocols (ACP) are used to preserve the ACID property in distributed systems. Two-Phase Commit (2PC) is most widely used but the blocking of sites is undesirable as these sites may be holding locks on the resources. As alternative, non-blocking ACP has been suggested: This nonblocking protocol is Three-Phase Commit (3PC) protocol which requires an extra phase (pre-commit) to remove blocking state. The existing protocols require so many messages transfer from the coordinator to participants and vice versa during different phases and corresponding increase communication and time complexity and hold the locks acquire by different participants till the end of last phase, forcing other transactions also to be blocked just because of the objects that are locked. All the existing protocols give the same performance for both deferred and immediate consistency constraints databases. Lots of protocols are being proposed and mainly the concentration was to make the 2PC protocol non-blocking or to minimize the blocking possibilities in 2PC. There has been a renewed interest in developing and optimization of more efficient ACPs. This paper is an effort to propose a new technique to optimize atomic commit protocols by optimizing voting phase based on deferred and immediate consistency constraints. Also an attempt has been made to propose reduction in communication complexity which will require less number of messages to be shared between coordinator and participants, the cost of execution as well as time delays.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
RC-OCP:反向协调优化提交协议
随着计算趋势的发展和对可靠计算环境的要求,以分布式方式执行任务的需求变得越来越重要。原子提交协议(ACP)用于在分布式系统中保持ACID属性。两阶段提交(Two-Phase Commit, 2PC)是最广泛使用的,但是阻塞站点是不可取的,因为这些站点可能持有对资源的锁。作为替代方案,建议使用非阻塞ACP:这种非阻塞协议是三相提交(3PC)协议,它需要额外的阶段(预提交)来消除阻塞状态。现有的协议需要在不同的阶段从协调器到参与者传输大量的消息,反之亦然,这相应地增加了通信和时间复杂性,并将不同参与者获得的锁保留到最后一个阶段结束,迫使其他事务也因为锁定的对象而被阻塞。所有现有协议对延迟一致性约束和即时一致性约束数据库都提供相同的性能。许多协议被提出,主要集中在使2PC协议无阻塞或最小化2PC中的阻塞可能性。人们重新对开发和优化更有效的acp产生了兴趣。本文提出了一种基于延迟一致性约束和即时一致性约束的投票阶段优化原子提交协议的新技术。此外,还提出了减少通信复杂性的建议,这将减少协调器和参与者之间共享的消息数量,减少执行成本和时间延迟。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Agro App: An application for healthy living Enhance matching in multi-dimensional image reconstruction using stereo image sequences DBIQS — An intelligent system for querying and mining databases using NLP Pros and cons of load balancing algorithms for cloud computing A real time scheduling algorithm for tolerating single transient fault
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1