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

Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing最新文献

筛选
英文 中文
Locking Timestamps versus Locking Objects 锁定时间戳与锁定对象
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212742
M. Aguilera, Tudor David, R. Guerraoui, Junxiong Wang
{"title":"Locking Timestamps versus Locking Objects","authors":"M. Aguilera, Tudor David, R. Guerraoui, Junxiong Wang","doi":"10.1145/3212734.3212742","DOIUrl":"https://doi.org/10.1145/3212734.3212742","url":null,"abstract":"We present multiversion timestamp locking (MVTL), a new genre of multiversion concurrency control algorithms for serializable transactions. The key idea behind MVTL is simple: lock individual timestamps instead of locking objects. After presenting a generic MVTL algorithm, we demonstrate MVTL's expressiveness: we give several simple MVTL algorithms that address limitations of current multiversion schemes, by committing transactions that previous schemes would abort, by avoiding the problems of serial aborts or ghost aborts, and by offering a way to prioritize transactions that should not be aborted. We give evidence that, in practice, MVTL-based algorithms can outperform alternative concurrency control schemes.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114935613","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
Brief Announcement: Space-Optimal Naming in Population Protocols 简要公告:人口协议中的空间最优命名
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212791
J. Burman, J. Beauquier, D. Sohier
{"title":"Brief Announcement: Space-Optimal Naming in Population Protocols","authors":"J. Burman, J. Beauquier, D. Sohier","doi":"10.1145/3212734.3212791","DOIUrl":"https://doi.org/10.1145/3212734.3212791","url":null,"abstract":"This paper gives a brief presentation of a comprehensive study on the necessary and sufficient state space conditions for the deterministic naming task in the population protocol model. This problem is studied under various combinations of model assumptions: weak or global fairness, arbitrary or uniform initialization of agents, existence or absence of a distinguishable agent (arbitrarily initialized or not), possibility of breaking symmetry in pair-wise interactions (symmetric or asymmetric transitions). For each possible combination of these assumptions, either an impossibility is proven or the necessary exact number of states (per mobile agent) is determined and an appropriate space-optimal naming protocol is given.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122439938","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}
引用次数: 4
Brief Announcement: Partially Replicated Causally Consistent Shared Memory 简短公告:部分复制因果一致共享内存
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212790
Zhuolun Xiang, N. Vaidya
{"title":"Brief Announcement: Partially Replicated Causally Consistent Shared Memory","authors":"Zhuolun Xiang, N. Vaidya","doi":"10.1145/3212734.3212790","DOIUrl":"https://doi.org/10.1145/3212734.3212790","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.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128243200","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
Session details: Session 2B: Routing and Leader Election 会话详细信息:会话2B:路由和领导者选举
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3258700
M. Ghaffari
{"title":"Session details: Session 2B: Routing and Leader Election","authors":"M. Ghaffari","doi":"10.1145/3258700","DOIUrl":"https://doi.org/10.1145/3258700","url":null,"abstract":"","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129197461","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
Tutorial: Consistency Choices in Modern Distributed Systems 教程:现代分布式系统中的一致性选择
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212800
Alexey Gotsman
{"title":"Tutorial: Consistency Choices in Modern Distributed Systems","authors":"Alexey Gotsman","doi":"10.1145/3212734.3212800","DOIUrl":"https://doi.org/10.1145/3212734.3212800","url":null,"abstract":"Distributed systems underlying large-scale Internet services often guarantee immediate availability and tolerate network failures at the expense of providing only weak data consistency guarantees. This is compensated for by new programming constructs, such as replicated data types (aka CRDTs) and novel forms of transactions. Navigating the spectrum of possible consistency models and programming constructs is far from trivial. This tutorial surveys recent developments that help in this: formal definitions of consistency model semantics and methods for reasoning about how the weakness of consistency models affects the correctness of applications using them.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113979419","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
Separating Lock-Freedom from Wait-Freedom 分离锁自由度和等待自由度
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212739
H. Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin
{"title":"Separating Lock-Freedom from Wait-Freedom","authors":"H. Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin","doi":"10.1145/3212734.3212739","DOIUrl":"https://doi.org/10.1145/3212734.3212739","url":null,"abstract":"A long-standing open question has been whether lock-freedom and wait-freedom are fundamentally different progress conditions, namely, can the former be provided in situations where the latter cannot? This paper answers the question in the affirmative, by proving that there are objects with lock-free implementations, but without wait-free implementations-using objects of any finite power. We precisely define an object called n-process long-lived approximate agreement (n-LLAA), in which two sets of processes associated with two sides, 0 or 1, need to decide on a sequence of increasingly closer outputs. We prove that 2-LLAA has a lock-free implementation using reads and writes only, while n-LLAA has a lock-free implementation using reads, writes and (n - 1)-process consensus objects. In contrast, we prove that there is no wait-free implementation of the n-LLAA object using reads, writes and specific (n - 1)-process consensus objects, called (n - 1)-window registers.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134228379","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}
引用次数: 1
Brief Announcement: Automatic Log Enhancement for Fault Diagnosis 简要公告:自动日志增强，用于故障诊断
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212784
Tong Jia, Ying Li, Zhonghai Wu
{"title":"Brief Announcement: Automatic Log Enhancement for Fault Diagnosis","authors":"Tong Jia, Ying Li, Zhonghai Wu","doi":"10.1145/3212734.3212784","DOIUrl":"https://doi.org/10.1145/3212734.3212784","url":null,"abstract":"When systems fail, logs are frequently the only evidence available for underlying fault diagnosis. Consequently, the quality of logs-how well system faults can be reflected by these log messages, is of significant importance. To improve the quality of logs, we propose a novel log enhancement approach which automatically identifies logging points that reflect anomalous behavior during system fault time. We further evaluate our approach with three popular open source projects. Results show that it can significantly improve over 50% accuracy of automatic fault diagnosis on average.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129451826","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
Leveraging Indirect Signaling for Topology Inference and Fast Broadcast 利用间接信令进行拓扑推断和快速广播
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212766
M. Halldórsson, Tigran Tonoyan
{"title":"Leveraging Indirect Signaling for Topology Inference and Fast Broadcast","authors":"M. Halldórsson, Tigran Tonoyan","doi":"10.1145/3212734.3212766","DOIUrl":"https://doi.org/10.1145/3212734.3212766","url":null,"abstract":"The physical (or SINR) model of wireless communication is more intricate than radio networks and still not well understood. If two neighbors of a node are transmitting, the node may be able to decode one of the transmissions, depending on the relative nearness of the transmitters. Thus, even the lack of proper reception carries indirect information. We explore here the power of such indirect signaling to infer the approximate topology of the network. In particular, we obtain a polylogarithmic time algorithm to compute a backbone: a set of nodes of constant density that dominates every ε-neighborhood. A backbone has wide utility for information dissemination, functioning as a sparse spanner. It also leads to fast broadcast, running in O(Diameter) time after a polylogarithmic precomputation, which previously was only known when additional features such as carrier sense, collision detection, geometric coordinates, or power control were available.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129676461","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}
引用次数: 4
Brief Announcement: 2D-Stack -- A Scalable Lock-Free Stack Design that Continuously Relaxes Semantics for Better Performance 简短公告:2D-Stack——一个可扩展的无锁堆栈设计，不断放松语义以获得更好的性能
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212794
A. Rukundo, A. Atalar, P. Tsigas
{"title":"Brief Announcement: 2D-Stack -- A Scalable Lock-Free Stack Design that Continuously Relaxes Semantics for Better Performance","authors":"A. Rukundo, A. Atalar, P. Tsigas","doi":"10.1145/3212734.3212794","DOIUrl":"https://doi.org/10.1145/3212734.3212794","url":null,"abstract":"We briefly describe an efficient lock-free concurrent stack design with tunable and tenable relaxed semantics to allow for better performance. The design is tunable and allow for a continuous monotonic trade of weaker semantics for better throughput performance. Concurrent stacks have an inherent scalability bottleneck due to their single access point for both their operations. Elimination and semantics relaxation have been proposed in the literature to address this problem. Semantics relaxation has the potential to reach monotonically very high throughput by continuously trading relaxation for throughput. Previous solutions could not fully leverage this potential. We suggest a new two dimensional design that can achieve this by exploiting disjoint access parallelism in one dimension and locality in the other within tight accuracy bounds. The behaviour of the algorithm is tightly bound. We compare experimentally to previous work, with respect to throughput and relaxed behaviour observed, on different relaxation and concurrency settings. The experimental evaluation shows that our algorithm significantly outperform all other algorithms in terms of performance, also maintain better accuracy in contrast to other designs with relaxed semantics.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117146044","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
Distributed Uniformity Testing 分布均匀性测试
Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing Pub Date : 2018-07-23 DOI: 10.1145/3212734.3212772
O. Fischer, Uri Meir, R. Oshman
{"title":"Distributed Uniformity Testing","authors":"O. Fischer, Uri Meir, R. Oshman","doi":"10.1145/3212734.3212772","DOIUrl":"https://doi.org/10.1145/3212734.3212772","url":null,"abstract":"In the uniformity testing problem, we are given access to samples from some unknown distribution μ on a fixed domain set1,..,n , and our goal is to distinguish the case where μ is the uniform distribution from the case where μ is ε-far from uniform in L_1 distance. Centralized uniformity testing has been extensively studied, and it is known that Θ(√ /ε^2) samples are necessary and sufficient. In this paper we study distributed uniformity testing : in a network of k nodes, each node i has access to s_i samples from the underlying distribution μ. Our goal is to test uniformity, while minimizing the number of samples per node, as well as the running time. We consider several distributed models: the ŁOCAL model, the CONGEST model, and a 0-round model where nodes cannot communicate with each other at all. We give upper bounds for each model, and a lower bound for the 0-round model. The key to our results is analyzing the centralized uniformity-testing problem in an unusual error regime, for which we give new upper and lower bounds.","PeriodicalId":198284,"journal":{"name":"Proceedings of the 2018 ACM Symposium on Principles of Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2018-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123681578","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}
引用次数: 13
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信