Proceedings of the ACM Symposium on Principles of Distributed Computing最新文献_第2页

Brief Announcement: Leader Election in SINR Model with Arbitrary Power Control 摘要:具有任意权力控制的SINR模型中的领导人选举

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087851

M. Halldórsson, S. Holzer, Evangelia Anna Markatou

引用次数: 7

Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model CC模型上具有恒定平摊RMR复杂度的随机可中止互斥

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087837

George Giakkoupis, Philipp Woelfel

引用次数: 11

Coordination Without Prior Agreement 未经事先协议的协调

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087807

G. Taubenfeld

引用次数: 23

Brief Announcement: Byzantine-Tolerant Machine Learning 简短公告:拜占庭容忍机器学习

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087861

Peva Blanchard, El Mahdi El Mhamdi, R. Guerraoui, J. Stainer

引用次数: 4

Brief Announcement: Rapid Asynchronous Plurality Consensus 简短公告:快速异步多元化共识

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087860

Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker

{"title":"Brief Announcement: Rapid Asynchronous Plurality Consensus","authors":"Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, Horst Trinker","doi":"10.1145/3087801.3087860","DOIUrl":"https://doi.org/10.1145/3087801.3087860","url":null,"abstract":"We consider distributed plurality consensus on a complete graph of size n with k initial opinions in the following asynchronous communication model. Each node is equipped with a random Poisson clock with parameter lambda=1. Whenever a node's clock ticks, it samples some neighbors uniformly at random and adjusts its opinion according to the sample. Distributed plurality consensus has been deeply studied in the synchronous communication model. A prominent example is the so-called Two-Choices protocol, where in each round, every node chooses two neighbors uniformly at random, and if the two sampled opinions coincide, then that opinion is adopted. This protocol is very efficient when k=2. If k=O(nε) for some small epsilon, we show that it converges to the initial plurality opinion within O(k log n) rounds, w.h.p., as long as the initial difference between the largest and second largest opinion is Omega(sqrt(n log n)). On the negative side, we show that there are cases in which Omega(k) rounds are needed, w.h.p. To beat this lower bound, we combine the Two-Choices protocol with push-pull broadcasting. We divide the process into several phases, where each phase consists of a two-choices round followed by several broadcasting rounds. Our main contribution is a non-trivial adaptation of this approach to the above asynchronous model. If the support of the most frequent opinion is at least (1+ε) times that of the second-most frequent one and k=O(Exp(log n / log log n)), then our protocol achieves the best possible run time of O(log n), w.h.p. Key to our adaptation is that we relax full synchronicity by allowing o(n) nodes to be poorly synchronized, and the well synchronized nodes are only required to be within a certain time difference from one another. We enforce this sufficient synchronicity by introducing a novel gadget into the protocol. Other parts of the adaptation are made to work using arguments and techniques based on a Pólya urn model.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115460649","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

Session details: Session 5 会话详情:会话5

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3252877

N. Lynch

引用次数: 0

Seeing is Believing: A Client-Centric Specification of Database Isolation 眼见为实:以客户为中心的数据库隔离规范

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087802

Natacha Crooks, Youer Pu, L. Alvisi, Allen Clement

{"title":"Seeing is Believing: A Client-Centric Specification of Database Isolation","authors":"Natacha Crooks, Youer Pu, L. Alvisi, Allen Clement","doi":"10.1145/3087801.3087802","DOIUrl":"https://doi.org/10.1145/3087801.3087802","url":null,"abstract":"This paper introduces the first state-based formalization of isolation guarantees. Our approach is premised on a simple observation: applications view storage systems as black-boxes that transition through a series of states, a subset of which are observed by applications. Defining isolation guarantees in terms of these states frees definitions from implementation-specific assumptions. It makes immediately clear what anomalies, if any, applications can expect to observe, thus bridging the gap that exists today between how isolation guarantees are defined and how they are perceived. The clarity that results from definitions based on client-observable states brings forth several benefits. First, it allows us to easily compare the guarantees of distinct, but semantically close, isolation guarantees. We find that several well-known guarantees, previously thought to be distinct, are in fact equivalent, and that many previously incomparable flavors of snapshot isolation can be organized in a clean hierarchy. Second, freeing definitions from implementation-specific artefacts can suggest more efficient implementations of the same isolation guarantee. We show how a client-centric implementation of parallel snapshot isolation can be more resilient to slowdown cascades, a common phenomenon in large-scale datacenters.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127088123","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}

引用次数: 46

A Template for Implementing Fast Lock-free Trees Using HTM 一个使用HTM实现快速无锁树的模板

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087834

Trevor Brown

{"title":"A Template for Implementing Fast Lock-free Trees Using HTM","authors":"Trevor Brown","doi":"10.1145/3087801.3087834","DOIUrl":"https://doi.org/10.1145/3087801.3087834","url":null,"abstract":"Algorithms that use hardware transactional memory (HTM) must provide a software-only fallback path to guarantee progress. The design of the fallback path can have a profound impact on performance. If the fallback path is allowed to run concurrently with hardware transactions, then hardware transactions must be instrumented, adding significant overhead. Otherwise, hardware transactions must wait for any processes on the fallback path, causing concurrency bottlenecks, or move to the fallback path. We introduce an approach that combines the best of both worlds. The key idea is to use three execution paths: an HTM fast path, an HTM middle path, and a software fallback path, such that the middle path can run concurrently with each of the other two. The fast path and fallback path do not run concurrently, so the fast path incurs no instrumentation overhead. Furthermore, fast path transactions can move to the middle path instead of waiting or moving to the software path. We demonstrate our approach by producing an accelerated version of the tree update template of Brown et al., which can be used to implement fast lock-free data structures based on down-trees. We used the accelerated template to implement two lock-free trees: a binary search tree (BST), and an (a,b)-tree (a generalization of a B-tree). Experiments show that, with 72 concurrent processes, our accelerated ($a,b$)-tree performs between 4.0x and 4.2x as many operations per second as an implementation obtained using the original tree update template.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133064162","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}

引用次数: 9

Brief Announcement: Population Protocols for Leader Election and Exact Majority with O(log2 n) States and O(log2 n) Convergence Time 简短公告:具有O(log2 n)状态和O(log2 n)收敛时间的领袖选举和精确多数的人口协议

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087858

Andreas Bilke, C. Cooper, Robert Elsässer, T. Radzik

引用次数: 44

Brief Announcement: Fast Shared Counting using (O(n)) Compare-and-Swap Registers 简短公告:使用(O(n))比较交换寄存器的快速共享计数

Proceedings of the ACM Symposium on Principles of Distributed Computing Pub Date : 2017-07-25 DOI: 10.1145/3087801.3087841

P. Khanchandani, Roger Wattenhofer

引用次数: 5