Brief Announcement: Partially Replicated Causally Consistent Shared Memory

Zhuolun Xiang, N. Vaidya
{"title":"Brief Announcement: Partially Replicated Causally Consistent Shared Memory","authors":"Zhuolun Xiang, N. Vaidya","doi":"10.1145/3212734.3212790","DOIUrl":null,"url":null,"abstract":"Distributed shared memory systems maintain multiple replicas of the shared memory registers. Maintaining causal consistency in such systems has received significant attention in the past. However, much of the previous literature focuses on \\em full replication wherein each replica stores a copy of all the registers in the shared memory. In this paper, we investigate causal consistency in partially replicated systems, wherein each replica may store only a subset of the shared data. To achieve causal consistency, it is necessary to ensure that, before an update is performed at any given replica, all causally preceding updates must also be performed. Achieving this goal requires some mechanism to track causal dependencies. In the context of full replication, this goal is often achieved using vector timestamps, with the number of vector elements being equal to the number of replicas. Building on the past work, this paper makes two key contributions: For a family of algorithms for maintaining causal consistency, we present necessary conditions on the metadata (which we refer as a \\em timestamp ) that must be maintained by each replica. We present an algorithm for achieving causal consistency using a timestamp that matches one of the necessary conditions referred above, thus showing that the condition is necessary and sufficient both.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3212734.3212790","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Distributed shared memory systems maintain multiple replicas of the shared memory registers. Maintaining causal consistency in such systems has received significant attention in the past. However, much of the previous literature focuses on \em full replication wherein each replica stores a copy of all the registers in the shared memory. In this paper, we investigate causal consistency in partially replicated systems, wherein each replica may store only a subset of the shared data. To achieve causal consistency, it is necessary to ensure that, before an update is performed at any given replica, all causally preceding updates must also be performed. Achieving this goal requires some mechanism to track causal dependencies. In the context of full replication, this goal is often achieved using vector timestamps, with the number of vector elements being equal to the number of replicas. Building on the past work, this paper makes two key contributions: For a family of algorithms for maintaining causal consistency, we present necessary conditions on the metadata (which we refer as a \em timestamp ) that must be maintained by each replica. We present an algorithm for achieving causal consistency using a timestamp that matches one of the necessary conditions referred above, thus showing that the condition is necessary and sufficient both.
简短公告:部分复制因果一致共享内存
分布式共享内存系统维护共享内存寄存器的多个副本。在这些系统中保持因果一致性在过去受到了极大的关注。然而,以前的许多文献都集中在em完全复制上,其中每个副本存储共享内存中所有寄存器的副本。在本文中,我们研究了部分复制系统中的因果一致性,其中每个副本只能存储共享数据的一个子集。为了实现因果一致性,有必要确保在对任何给定副本执行更新之前,也必须执行所有因果更新。实现这一目标需要一些机制来跟踪因果关系。在完全复制的上下文中,通常使用向量时间戳实现此目标,其中向量元素的数量等于副本的数量。在过去工作的基础上,本文做出了两个关键贡献:对于维护因果一致性的一系列算法,我们提出了每个副本必须维护的元数据(我们称之为\em时间戳)的必要条件。我们提出了一种算法,使用与上述必要条件之一匹配的时间戳来实现因果一致性,从而表明该条件既是必要条件又是充分条件。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信