发布求助
文献互助 智能选刊 最新文献

PaPoC '18最新文献

筛选
英文 中文
Making consistency more consistent: a unified model for coherence, consistency and isolation 使一致性更加一致:一致性、一致性和隔离的统一模型
PaPoC '18 Pub Date : 2018-04-23 DOI: 10.1145/3194261.3194268
Adriana Szekeres, Irene Zhang
{"title":"Making consistency more consistent: a unified model for coherence, consistency and isolation","authors":"Adriana Szekeres, Irene Zhang","doi":"10.1145/3194261.3194268","DOIUrl":"https://doi.org/10.1145/3194261.3194268","url":null,"abstract":"Ordering guarantees are often defined using abstract execution models [2, 8-11, 19, 22]. Unfortunately, these models are complex and make different assumptions about system semantics. As a result, researchers find it impossible to compare the ordering guarantees of coherence, consistency and isolation. This paper presents a simple, unified model for defining ordering guarantees that is sufficiently general to model a wide range of systems, including processor memory, distributed storage, and databases. We define a new single constraint relationship, result visibility, which formalizes the \"appears to execute before\" relationship between operations. Using only result visibility, we define more than 20 ordering guarantees from different research areas, including PRAM [17], snapshot isolation [6] and eventual consistency session guarantees [21]. To our knowledge, these definitions form the broadest survey of ordering guarantees using a single constraint in the current literature.","PeriodicalId":123272,"journal":{"name":"PaPoC '18","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130463141","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Towards affordable externally consistent guarantees for geo-replicated systems 为地理复制系统提供可负担得起的外部一致保证
PaPoC '18 Pub Date : 2018-04-23 DOI: 10.1145/3194261.3194264
Manuel Bravo, L. Rodrigues
{"title":"Towards affordable externally consistent guarantees for geo-replicated systems","authors":"Manuel Bravo, L. Rodrigues","doi":"10.1145/3194261.3194264","DOIUrl":"https://doi.org/10.1145/3194261.3194264","url":null,"abstract":"We propose a novel consistency model called external causality, which aims at making external consistency affordable for geo-replicated systems. In this short paper, we (i) outline this idea---informally defining external causality, and (ii) motivate it with two simple examples that illustrate how developers of cloud services may benefit from it.","PeriodicalId":123272,"journal":{"name":"PaPoC '18","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117298882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Constraining the eventual in eventual consistency 在最终一致性中约束最终的
PaPoC '18 Pub Date : 2018-04-23 DOI: 10.1145/3194261.3194263
Jim Bauwens, Florian Myter, E. G. Boix
{"title":"Constraining the eventual in eventual consistency","authors":"Jim Bauwens, Florian Myter, E. G. Boix","doi":"10.1145/3194261.3194263","DOIUrl":"https://doi.org/10.1145/3194261.3194263","url":null,"abstract":"CRDTs are highly available replicated data structures which offer strong eventual consistency in the face of concurrent operations [3]. By their definition, CRDTs eventually converge to a consistent state given enough time. However, this is not strict enough for some distributed applications. Current state-of-the-art CRDT implementations fail to provide programmers with the means to specify these constraints. As a result, programmers need to write application-level code which ignores stale or timed-out operations. In this paper, we introduce a leasing model which allows programmers to declaratively specify timing constraints for CRDTs. In short, programmers are able to attach leases to operations on a CRDT instance. When such a lease expires the underlying implementation ensures that the operation is eventually canceled for all replicas.","PeriodicalId":123272,"journal":{"name":"PaPoC '18","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123162908","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards causal datacenter networks 走向因果数据中心网络
PaPoC '18 Pub Date : 2018-04-23 DOI: 10.1145/3194261.3194269
Ellis Michael, Dan R. K. Ports
{"title":"Towards causal datacenter networks","authors":"Ellis Michael, Dan R. K. Ports","doi":"10.1145/3194261.3194269","DOIUrl":"https://doi.org/10.1145/3194261.3194269","url":null,"abstract":"Traditionally, distributed systems conservatively assume an asynchronous network. However, recent work on the co-design of networks and distributed systems has shown that stronger ordering properties are achievable in datacenter networks and yield performance improvements for the distributed systems they support. We build on that trend and ask whether it is possible for the datacenter network to order all messages in a protocol-agnostic way. This approach, which we call omnisequencing, would ensure causal delivery of all messages, making consistency a network-level guarantee.","PeriodicalId":123272,"journal":{"name":"PaPoC '18","volume":"385 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124784293","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Fine-grained distributed consistency guarantees with effect orchestration 细粒度分布式一致性保证效果编排
PaPoC '18 Pub Date : 2018-04-23 DOI: 10.1145/3194261.3194267
Kia Rahmani, Gowtham Kaki, S. Jagannathan
{"title":"Fine-grained distributed consistency guarantees with effect orchestration","authors":"Kia Rahmani, Gowtham Kaki, S. Jagannathan","doi":"10.1145/3194261.3194267","DOIUrl":"https://doi.org/10.1145/3194261.3194267","url":null,"abstract":"Highly-available distributed applications typically require data to be replicated over geo-distributed stores that offer weak consistency guarantees by default. Unfortunately, undesirable behaviors may arise under weak consistency that can violate application correctness, forcing designers to either implement complex ad-hoc mechanisms to avoid these anomalies or by sacrificing performance, choose to run applications using stronger levels of consistency. In this paper, we describe a lightweight runtime system that relieves developers from having to make such tradeoffs. Instead, our approach leverages declarative axiomatic specifications that reflect the necessary constraints any correct implementation must satisfy to guide a runtime consistency enforcement and monitoring mechanism. Experimental results show that the performance of our (provably optimal and safe) automatically derived fine-grained consistency enforcement mechanisms is better than common store-offered consistency guarantees.","PeriodicalId":123272,"journal":{"name":"PaPoC '18","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114821331","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信
小红书