网络分区后有效同步crdt的Join分解:工作进度报告

Vitor Enes, Carlos Baquero, Paulo Sérgio Almeida, Ali Shoker
{"title":"网络分区后有效同步crdt的Join分解:工作进度报告","authors":"Vitor Enes, Carlos Baquero, Paulo Sérgio Almeida, Ali Shoker","doi":"10.1145/2957319.2957374","DOIUrl":null,"url":null,"abstract":"State-based CRDTs allow updates on local replicas without remote synchronization. Once these updates are propagated, possible conflicts are resolved deterministically across all replicas. δ-CRDTs bring significant advantages in terms of the size of messages exchanged between replicas during normal operation. However, when a replica joins the system after a network partition, it needs to receive the updates it missed and propagate the ones performed locally. Current systems solve this by exchanging the full state bidirectionally or by storing additional metadata along the CRDT. We introduce the concept of join-decomposition for state-based CRDTs, a technique orthogonal and complementary to delta-mutation, and propose two synchronization methods that reduce the amount of information exchanged, with no need to modify current CRDT definitions.","PeriodicalId":316230,"journal":{"name":"First Workshop on Programming Models and Languages for Distributed Computing","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Join Decompositions for Efficient Synchronization of CRDTs after a Network Partition: Work in progress report\",\"authors\":\"Vitor Enes, Carlos Baquero, Paulo Sérgio Almeida, Ali Shoker\",\"doi\":\"10.1145/2957319.2957374\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"State-based CRDTs allow updates on local replicas without remote synchronization. Once these updates are propagated, possible conflicts are resolved deterministically across all replicas. δ-CRDTs bring significant advantages in terms of the size of messages exchanged between replicas during normal operation. However, when a replica joins the system after a network partition, it needs to receive the updates it missed and propagate the ones performed locally. Current systems solve this by exchanging the full state bidirectionally or by storing additional metadata along the CRDT. We introduce the concept of join-decomposition for state-based CRDTs, a technique orthogonal and complementary to delta-mutation, and propose two synchronization methods that reduce the amount of information exchanged, with no need to modify current CRDT definitions.\",\"PeriodicalId\":316230,\"journal\":{\"name\":\"First Workshop on Programming Models and Languages for Distributed Computing\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-07-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"First Workshop on Programming Models and Languages for Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2957319.2957374\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"First Workshop on Programming Models and Languages for Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2957319.2957374","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

摘要

基于状态的crdt允许在没有远程同步的情况下对本地副本进行更新。一旦传播了这些更新,就可以确定地解决所有副本之间可能的冲突。δ- crdt在正常操作期间在副本之间交换的消息大小方面具有显着优势。但是,当一个副本在网络分区之后加入系统时,它需要接收它错过的更新,并传播在本地执行的更新。当前的系统通过双向交换完整状态或在CRDT上存储额外的元数据来解决这个问题。针对基于状态的CRDT,我们引入了一种与delta-mutation正交互补的联合分解的概念,并提出了两种同步方法,在不修改当前CRDT定义的情况下减少了信息交换量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Join Decompositions for Efficient Synchronization of CRDTs after a Network Partition: Work in progress report
State-based CRDTs allow updates on local replicas without remote synchronization. Once these updates are propagated, possible conflicts are resolved deterministically across all replicas. δ-CRDTs bring significant advantages in terms of the size of messages exchanged between replicas during normal operation. However, when a replica joins the system after a network partition, it needs to receive the updates it missed and propagate the ones performed locally. Current systems solve this by exchanging the full state bidirectionally or by storing additional metadata along the CRDT. We introduce the concept of join-decomposition for state-based CRDTs, a technique orthogonal and complementary to delta-mutation, and propose two synchronization methods that reduce the amount of information exchanged, with no need to modify current CRDT definitions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Towards Aggregate Programming in Scala On the Potential of Event Sourcing for Retroactive Actor-based Programming Integration Challenges of Pure Operation-based CRDTs in Redis Fractional Permissions for Race-Free Mutable References in a Dataflow Intermediate Language Static Type Checking for the Kompics Component Model: Kola -- The Kompics Language
×
引用
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