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

Distributed MIS via All-to-All Communication 通过全对全通信实现分布式管理信息系统

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

M. Ghaffari

引用次数: 40

Clocked Population Protocols 定时人口协议

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

J. Aspnes

{"title":"Clocked Population Protocols","authors":"J. Aspnes","doi":"10.1145/3087801.3087836","DOIUrl":"https://doi.org/10.1145/3087801.3087836","url":null,"abstract":"Population protocols are required to converge to the correct answer, and are subject to a fairness condition that guarantees eventual progress, but generally have no internal mechanism for detecting when this progress has occurred. We define an extension to the standard population protocol that provides each agent with a clock signal that indicates when the agent has waited long enough. To simplify the model, we represent \"long enough\" as an infinite time interval, and treat a clocked population protocol as operating over transfinite time. This gives a clean theoretical model that we show how to translate back into finite real-world executions where the clock ticks whenever the underlying protocol is looping or stuck. Over finite time intervals, the protocol behaves as in the standard model. At nonzero limit ordinals ω, ω2, etc., corresponding to clock ticks, the protocol switches to a limit of previous configurations supplemented by an signal registering in an extra component in some of the agents' states. Using transfinite times means that we can represent fairness over sequences of transitions that may include clock ticks with the same definition as over smaller intervals. Using arbitrary ordinals allows using times like ω2 or ω3 to represent convergence that depends on detecting convergence repeatedly at lower levels. We show that a clocked population protocol running in less than ωk time for any fixed k ≥ 2 is equivalent in power to a nondeterministic Turing machine with space complexity logarithmic in the size of the population. A consequence of this equivalence is that any symmetric predicate that can be computed in less than ωk time can be computed in less than ω2 time, which requires only finitely many clock ticks.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"4 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":"117117962","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}

引用次数: 10

Symmetry Breaking with Noisy Processes 带噪声过程的对称性破缺

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

Seth Gilbert, Calvin C. Newport

{"title":"Symmetry Breaking with Noisy Processes","authors":"Seth Gilbert, Calvin C. Newport","doi":"10.1145/3087801.3087814","DOIUrl":"https://doi.org/10.1145/3087801.3087814","url":null,"abstract":"Biology and computer science intersect at the problem of symmetry breaking, which is relevant in both fields. Accordingly, in recent years, distributed algorithm theorists have studied symmetry breaking problems in models inspired by biology to help provide insight into the capabilities and constraints of this natural process. A potential shortcoming of these models, however, is that they execute distributed algorithms precisely as specified. In nature, where computation is often implemented by messy analog systems, this precision cannot necessarily be guaranteed. Motivated by this observation, in this paper we present a general method for injecting computational noise into any distributed system model that describes processes as interacting state machines. Our method captures noise as a force that can cause state machines to transition to the wrong state. We combine this formalization of noise with the beeping models that have been a popular target of recent work on bio-inspired symmetry breaking. We produce new upper and lower bounds for both single hop and multihop models---studying leader election in the former and the maximal independent set problem in the latter. These bounds introduce new techniques for achieving robustness to noise, and identify some fundamental limits in this pursuit. We argue that both our general approach and specific results can help advance the productive relationship between biology and algorithm theory.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"70 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":"129124587","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

Brief Announcement: Statement Voting and Liquid Democracy 简短公告:声明投票和流动民主

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

Bingsheng Zhang, Hong-Sheng Zhou

{"title":"Brief Announcement: Statement Voting and Liquid Democracy","authors":"Bingsheng Zhang, Hong-Sheng Zhou","doi":"10.1145/3087801.3087868","DOIUrl":"https://doi.org/10.1145/3087801.3087868","url":null,"abstract":"The existing (election) voting systems, e.g., representative democracy, have many limitations and often fail to serve the best interest of the people in collective decision making. To address this issue, the concept of liquid democracy has been emerging as an alternative decision-making model to make better use of \"the wisdom of crowds\". Very recently, a few liquid democracy implementations, e.g. Google Votes and Decentralized Autonomous Organization (DAO), are released; however, those systems only focus on the functionality aspect, as no privacy/anonymity is considered. In this work, we, for the first time, provide a rigorous study of liquid democracy under the Universal Composability (UC) frame- work. In the literature, liquid democracy was achieved via two separate stages -- delegation and voting. We propose an efficient liquid democracy e-voting scheme that uni es these two stages. At the core of our design is a new voting concept called statement voting, which can be viewed as a natural extension of the conventional voting approaches. We remark that our statement voting can be extended to enable more complex voting and generic ledger-based non-interactive multi-party computation. We believe that the statement voting concept opens a door for constructing a new class of e-voting schemes.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"39 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":"122372513","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}

引用次数: 14

Session details: Session 7 会话详情:会话7

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

L. Alvisi

引用次数: 0

Brief Announcement: Gossiping with Latencies 简短声明:与延迟者八卦

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

Seth Gilbert, Peter Robinson, S. Sourav

{"title":"Brief Announcement: Gossiping with Latencies","authors":"Seth Gilbert, Peter Robinson, S. Sourav","doi":"10.1145/3087801.3087846","DOIUrl":"https://doi.org/10.1145/3087801.3087846","url":null,"abstract":"Consider the classical problem of information dissemination: one (or more) nodes in a network have some information that they want to distribute to the remainder of the network. In this paper, we study the cost of information dissemination in networks where edges have latencies, i.e., sending a message from one node to another takes some amount of time. We first generalize the idea of conductance to weighted graphs, defining φ* to be the \"weighted conductance\" and l* to be the \"critical latency.\" One goal of this paper is to argue that φ* characterizes the connectivity of a weighted graph with latencies in much the same way that conductance characterizes the connectivity of unweighted graphs. We give near tight lower and upper bounds on the problem of information dissemination. Specifically, we show that in a graph with (weighted) diameter D (with latencies as weights), maximum degree Δ, weighted conductance φ* and critical latency l*, any information dissemination algorithm requires at least Ω(min(D+Δ, l*/φ*)) time. We then give nearly matching algorithms, showing that information dissemination can be solved in O(min((D + Δ)log3n), (l*/φ*)log(n)) time.","PeriodicalId":324970,"journal":{"name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","volume":"177 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":"116847965","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

Session details: Session 3 会话详情:会话3

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

K. Konwar

引用次数: 0

Session details: Session 2 会话详情:会话2

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

Faith Ellen

引用次数: 0

Effectiveness of Delaying Timestamp Computation 延迟时间戳计算的有效性

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

S. Kulkarni, N. Vaidya

引用次数: 7

Session details: Session 6 会话详情:会话6

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

G. Taubenfeld

引用次数: 0