Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data最新文献

筛选
英文 中文
Testing properties of weakly consistent programs with Repliss 用Repliss测试弱一致性程序的性质
Peter Zeller
{"title":"Testing properties of weakly consistent programs with Repliss","authors":"Peter Zeller","doi":"10.1145/3064889.3064893","DOIUrl":"https://doi.org/10.1145/3064889.3064893","url":null,"abstract":"Repliss is a tool for the verification of programs which are built on top of weakly consistent databases. As one part of Repliss, we have built an automated, property based testing engine. It explores executions of a given application with randomized invocations and scheduling while checking for invariant violations. When an invariant is broken, Repliss minimizes the execution and displays a visualization of the minimized failing execution. Our contributions are 1. heuristics used to quickly find invariant violations, 2. a strategy to shrink executions, and 3. integrating a testing approach with the overall Repliss tool.","PeriodicalId":181823,"journal":{"name":"Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127468956","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}
引用次数: 11
FMKe: a Real-World Benchmark for Key-Value Data Stores FMKe:键值数据存储的真实基准
Gonçalo Tomás, Peter Zeller, Valter Balegas, Deepthi Devaki Akkoorath, Annette Bieniusa, J. Leitao, Nuno M. Preguiça
{"title":"FMKe: a Real-World Benchmark for Key-Value Data Stores","authors":"Gonçalo Tomás, Peter Zeller, Valter Balegas, Deepthi Devaki Akkoorath, Annette Bieniusa, J. Leitao, Nuno M. Preguiça","doi":"10.1145/3064889.3064897","DOIUrl":"https://doi.org/10.1145/3064889.3064897","url":null,"abstract":"Standard benchmarks are essential tools to enable developers to validate and evaluate their systems' design in terms of both relevant properties and performance. Benchmarks provide the means to evaluate a system with workloads that mimics real use cases. Although a large number of benchmarks exist for database system, there is a lack of standard benchmarks for an increasingly relevant class of storage systems: geo-replicated key-value stores providing weak consistency guarantees. This has led developers and researchers to rely on ad-hoc tools, whose results are both hard to reproduce and compare. In this paper, we propose the first standardized benchmark specially tailored for weakly consistent key-value stores. The benchmark, named FMKe, is modeled after a real application: the Danish National Joint Medicine Card. The benchmark is scalable, it can be parameterized to emulate a large number of access patterns, and it is also highly flexible, enabling its application on systems that offer different consistency guarantees and mechanisms.","PeriodicalId":181823,"journal":{"name":"Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127161990","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}
引用次数: 6
pluto: The CRDT-Driven IMAP Server pluto: crdt驱动的IMAP服务器
T. Jungnickel, Lennart Oldenburg
{"title":"pluto: The CRDT-Driven IMAP Server","authors":"T. Jungnickel, Lennart Oldenburg","doi":"10.1145/3064889.3064891","DOIUrl":"https://doi.org/10.1145/3064889.3064891","url":null,"abstract":"A typical cloud deployment of an IMAP service follows the service-statelessness principle, i.e. a load balancer distributes the requests to a mostly stateless backend that stores application state on a network file system like NFS. Within this work we suggest an alternative architecture allowing the backend to maintain its own replica of application state, leading to shorter response times and increased fault tolerance. To ensure convergence among replicas, we use CRDTs to model application state and evaluate the performance of our prototypical implementation against the de facto standard IMAP server Dovecot in multiple experimentation settings.","PeriodicalId":181823,"journal":{"name":"Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129837282","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}
引用次数: 3
Compact Resettable Counters through Causal Stability 通过因果稳定性压缩可复位计数器
Georges Younes, Paulo Sérgio Almeida, Carlos Baquero
{"title":"Compact Resettable Counters through Causal Stability","authors":"Georges Younes, Paulo Sérgio Almeida, Carlos Baquero","doi":"10.1145/3064889.3064892","DOIUrl":"https://doi.org/10.1145/3064889.3064892","url":null,"abstract":"Conflict-free Data Types (CRDTs) were designed to automatically resolve conflicts in eventually consistent systems. Different CRDTs were designed in both operation-based and state-based flavors such as Counters, Sets, Registers, Maps, etc. In a previous paper [2], Baquero et al. presented the problem with embedded CRDT counters and a solution, covering state-based counters that can be embedded in maps, but needing an ad-hoc extension to the standard counter API. Here, we present a resettable operation-based counter design, with the standard simple API and small state, through a causal-stability-based state compaction.","PeriodicalId":181823,"journal":{"name":"Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116991704","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}
引用次数: 5
Borrowing an Identity for a Distributed Counter: Work in progress report 借用分布式计数器的标识:工作进度报告
Vitor Enes, Carlos Baquero, Paulo Sérgio Almeida, J. Leitao
{"title":"Borrowing an Identity for a Distributed Counter: Work in progress report","authors":"Vitor Enes, Carlos Baquero, Paulo Sérgio Almeida, J. Leitao","doi":"10.1145/3064889.3064894","DOIUrl":"https://doi.org/10.1145/3064889.3064894","url":null,"abstract":"Conflict-free Replicated Data Types (CRDTs) are data abstractions (registers, counters, sets, maps, among others) that provide a relaxed consistency model called Eventual Consistency. Current designs for CRDT counters do not scale, having a size linear with the number of both active and retired nodes (i.e., nodes that leave the system permanently after previously manipulating the value of the counter). In this paper we present a new counter design called Borrow-Counter, that provides a mechanism for the retirement of transient nodes, keeping the size of the counter linear with the number of active nodes.","PeriodicalId":181823,"journal":{"name":"Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127009051","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
Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data 第三届分布式数据一致性原则与实践国际研讨会论文集
Annette Bieniusa, Alexey Gotsman
{"title":"Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data","authors":"Annette Bieniusa, Alexey Gotsman","doi":"10.1145/3064889","DOIUrl":"https://doi.org/10.1145/3064889","url":null,"abstract":"Consistency is one of the fundamental issues of distributed computing. There are many competing consistency models, with subtly different power in principle. In practice, the well known the Consistency-Availability-Partition Tolerance trade-off translates to difficult choices between fault tolerance, performance, and programmability. The issues and trade-offs are particularly vexing at scale, with a large number of processes or a large shared database, and in the presence of high latency and failure-prone networks. It is clear that there is no one universally best solution. Possible approaches cover the whole spectrum between strong and eventual consistency. Strong consistency (linearizability or serializability, achieved via total ordering) provides familiar and intuitive semantics but requires slow and fragile synchronization and coordination overheads. The unlimited parallelism allowed by weaker models such as eventual consistency promises high performance, but divergence and conflicts make it difficult to ensure useful application invariants, and metadata is hard to keep in check. The research and development communities are actively exploring intermediate models (replicated data types, monotonic programming, CRDTs, LVars, causal consistency, red-blue consistency, invariant- and proof-based systems, etc.), designed to improve efficiency, programmability, and overall operation without negatively impacting scalability.","PeriodicalId":181823,"journal":{"name":"Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128947890","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
Transparent cross-system consistency 透明的跨系统一致性
João Loff, D. Porto, Carlos Baquero, J. Garcia, Nuno M. Preguiça, R. Rodrigues
{"title":"Transparent cross-system consistency","authors":"João Loff, D. Porto, Carlos Baquero, J. Garcia, Nuno M. Preguiça, R. Rodrigues","doi":"10.1145/3064889.3064898","DOIUrl":"https://doi.org/10.1145/3064889.3064898","url":null,"abstract":"This paper discusses the motivation and the challenges for providing a systematic and transparent approach for dealing with cross-system consistency. Our high level goal is to provide a way to avoid violations of causality when multiple systems interact, while (a) avoiding the redesign of existing systems, (b) minimizing the overhead, and (c) requiring as little developer input as possible.","PeriodicalId":181823,"journal":{"name":"Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124009468","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
Bringing Hybrid Consistency Closer to Programmers 让程序员更接近混合一致性
G. Marcelino, Valter Balegas, Carla Ferreira
{"title":"Bringing Hybrid Consistency Closer to Programmers","authors":"G. Marcelino, Valter Balegas, Carla Ferreira","doi":"10.1145/3064889.3064896","DOIUrl":"https://doi.org/10.1145/3064889.3064896","url":null,"abstract":"Hybrid consistency is a new consistency model that tries to combine the benefits of weak and strong consistency. To implement hybrid consistency, programmers have to identify conflicting operations in applications and instrument them, which is a difficult and error prone task. More recent approaches automatize the process through the use of static analysis over a specification of the application. In this paper we present a new tool that is under development that tries to make the technology more accessible for programmers. Our tool is based on the same well-founded principles of existing work, but uses an intermediate verification language, Boogie, that improves the tool usability and scope in a number of ways. Using a general language for writing specifications makes specifications easier to write and improves expressiveness. Also, we leverage the language to add a library of CRDTs, which allows the programmer to solve conflicts without coordination. We discuss the features that we have already implemented and how they contribute to improve the technology.","PeriodicalId":181823,"journal":{"name":"Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data","volume":"412 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131645677","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}
引用次数: 8
As Secure as Possible Eventual Consistency: Work in Progress 尽可能安全的最终一致性:正在进行的工作
Ali Shoker, Houssam Yactine, Carlos Baquero
{"title":"As Secure as Possible Eventual Consistency: Work in Progress","authors":"Ali Shoker, Houssam Yactine, Carlos Baquero","doi":"10.1145/3064889.3064895","DOIUrl":"https://doi.org/10.1145/3064889.3064895","url":null,"abstract":"Eventual consistency (EC) is a relaxed data consistency model that, driven by the CAP theorem, trades prompt consistency for high availability. Although, this model has shown to be promising and greatly adopted by industry, the state of the art only assumes that replicas can crash and recover. However, a Byzantine replica (i.e., arbitrary or malicious) can hamper the eventual convergence of replicas to a global consistent state, thus compromising the entire service. Classical BFT state machine replication protocols cannot solve this problem due to the blocking nature of consensus, something at odd with the availability via replica divergence in the EC model. In this work in progress paper, we introduce a new secure highly available protocol for the EC model that assumes a fraction of replicas and any client can be Byzantine. To respect the essence of EC, the protocol gives priority to high availability, and thus Byzantine detection is performed off the critical path on a consistent data offset. The paper concisely explains the protocol and discusses its feasibility. We aim at presenting a more comprehensive and empirical study in the future.","PeriodicalId":181823,"journal":{"name":"Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123269732","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}
引用次数: 6
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学术官方微信
小红书