Optimistic replication

Author:

Saito Yasushi1,Shapiro Marc2

Affiliation:

1. Hewlett-Packard Laboratories, Palo Alto, CA, USA

2. Microsoft Research Ltd., Cambridge, UK

Abstract

Data replication is a key technology in distributed systems that enables higher availability and performance. This article surveys optimistic replication algorithms. They allow replica contents to diverge in the short term to support concurrent work practices and tolerate failures in low-quality communication links. The importance of such techniques is increasing as collaboration through wide-area and mobile networks becomes popular.Optimistic replication deploys algorithms not seen in traditional “pessimistic” systems. Instead of synchronous replica coordination, an optimistic algorithm propagates changes in the background, discovers conflicts after they happen, and reaches agreement on the final contents incrementally.We explore the solution space for optimistic replication algorithms. This article identifies key challenges facing optimistic replication systems---ordering operations, detecting and resolving conflicts, propagating changes efficiently, and bounding replica divergence---and provides a comprehensive survey of techniques developed for addressing these challenges.

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science,Theoretical Computer Science

Reference138 articles.

1. Adly N. 1995. Management of replicated data in large scale systems. Ph.D. thesis Corpus Cristi College University of Cambridge.]] Adly N. 1995. Management of replicated data in large scale systems. Ph.D. thesis Corpus Cristi College University of Cambridge.]]

2. Lazy consistency using loosely synchronized clocks

3. Epidemic algorithms in replicated databases (extended abstract)

4. Albitz P. and Liu C. 2001. DNS and BIND 4th Ed. O'Reilly & Associates. Sebastopol CA. ISBN 0-596-00158-4.]] Albitz P. and Liu C. 2001. DNS and BIND 4th Ed. O'Reilly & Associates. Sebastopol CA. ISBN 0-596-00158-4.]]

5. Panasync

Cited by 284 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Quantifying the Performance of Conflict-free Replicated Data Types in InterPlanetary File System;Proceedings of the 4th International Workshop on Distributed Infrastructure for the Common Good;2023-12-11

2. Efficient Synchronization of CRDTs using VCube-PS;12th Latin-American Symposium on Dependable and Secure Computing;2023-10-16

3. Algebra of Data Reconciliation;Studia Scientiarum Mathematicarum Hungarica;2022-12-14

4. Efficient Renaming in Sequence CRDTs;IEEE Transactions on Parallel and Distributed Systems;2022-12-01

5. Efficient CRDT Synchronization at Scale using a Causal Multicast over a Virtual Hypercube Overlay;Proceedings of the 11th Latin-American Symposium on Dependable Computing;2022-11-21

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3