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

Does Preprocessing Help under Congestion? 在拥塞情况下，预处理有帮助吗?

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2019-07-16 DOI: 10.1145/3293611.3331581

Klaus-Tycho Foerster, Janne H. Korhonen, J. Rybicki, S. Schmid

引用次数: 8

Self-Stabilizing Leader Election 自稳型领导人选举

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2019-07-16 DOI: 10.1145/3293611.3331616

Hsueh-Ping Chen, Ho-Lin Chen

引用次数: 18

Byzantine Fault Tolerant State Machine Replication in Any Programming Language 拜占庭容错状态机复制在任何编程语言

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2019-07-16 DOI: 10.1145/3293611.3338023

Ethan Buchman

{"title":"Byzantine Fault Tolerant State Machine Replication in Any Programming Language","authors":"Ethan Buchman","doi":"10.1145/3293611.3338023","DOIUrl":"https://doi.org/10.1145/3293611.3338023","url":null,"abstract":"State machine replication is a fundamental primitive in fault tolerant distributed computing, but few production tools exist to support the replication of arbitrary state machines. The tools that do exist, like Apache Zookeeper, CoreOS's etcd, and Hashicrop's Consul, include an implementation of a consensus algorithm (eg. ZAB or Raft) for replication, and a service-discovery oriented key-value store as the state machine. While these tools can tolerate crash failures, they cannot tolerate malicious or adversarial (\"Byzantine\") faults. We present Tendermint, a production-grade Byzantine Fault Tolerant State Machine Replication engine written in Go. Tendermint supports replication for state machines written in any language by using a socket protocol to communicate between the state machine and the replication engine. Tendermint is being used on the public internet today to secure upwards of 1 Billion USD in value, with deployments supporting hundreds of consensus nodes. In this workshop, we provide an overview of the Tendermint system and demonstrate how to build Byzantine Fault Tolerant applications in Go and Javascript. We will also introduce the Cosmos Hub, an advanced Proof-of-Stake cryptocurrency system built on Tendermint.","PeriodicalId":153766,"journal":{"name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130575902","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

Multiparty Interactive Communication with Private Channels 基于私有通道的多方交互通信

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2019-07-16 DOI: 10.1145/3293611.3331571

Abhinav Aggarwal, Varsha Dani, Thomas P. Hayes, Jared Saia

引用次数: 3

Symmetry Breaking in the Plane: Rendezvous by Robots with Unknown Attributes 平面对称性破缺:未知属性机器人的交会

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2019-07-16 DOI: 10.1145/3293611.3331608

J. Czyzowicz, L. Gąsieniec, R. Killick, E. Kranakis

{"title":"Symmetry Breaking in the Plane: Rendezvous by Robots with Unknown Attributes","authors":"J. Czyzowicz, L. Gąsieniec, R. Killick, E. Kranakis","doi":"10.1145/3293611.3331608","DOIUrl":"https://doi.org/10.1145/3293611.3331608","url":null,"abstract":"We study a fundamental question related to the feasibility of deterministic symmetry breaking in the infinite Euclidean plane for two robots that have minimal or no knowledge of the respective capabilities and \"measuring instruments'' of themselves and each other. Assume that two anonymous mobile robots are placed at different locations at unknown distance d from each other on the infinite Euclidean plane. Each robot knows neither the location of itself nor of the other robot. The robots cannot communicate wirelessly, but have a certain nonzero visibility radius r (with range r unknown to the robots). By rendezvous we mean that they are brought at distance at most r of each other by executing symmetric (identical) mobility algorithms. The robots are moving with unknown and constant but not necessarily identical speeds, their clocks and pedometers may be asymmetric, and their chirality inconsistent. We demonstrate that rendezvous for two robots is feasible under the studied model iff the robots have either: different speeds; or different clocks; or different orientations but equal chiralities. When the rendezvous is feasible, we provide a universal algorithm which always solves rendezvous despite the fact that the robots have no knowledge of which among their respective parameters may be different.","PeriodicalId":153766,"journal":{"name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126992426","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

Towards a Theory of Randomized Shared Memory Algorithms 随机共享内存算法理论研究

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2019-07-16 DOI: 10.1145/3293611.3338838

Philipp Woelfel

{"title":"Towards a Theory of Randomized Shared Memory Algorithms","authors":"Philipp Woelfel","doi":"10.1145/3293611.3338838","DOIUrl":"https://doi.org/10.1145/3293611.3338838","url":null,"abstract":"Randomization has become an invaluable tool to overcome some of the problems associated with asynchrony and faultiness. Allowing processors to use random bits helps to break symmetry, and to reduce the likelihood of undesirable schedules. As a consequence, randomized techniques can lead to simpler and more efficient algorithms, and sometimes to solutions of otherwise unsolvable computational problems. However, the design and the analysis of randomized shared memory algorithms remains challenging. This talk will give an overview of recent progress towards developing a theory of randomized shared memory algorithms. For many years, linearizability [6] has been the gold standard of distributed correctness conditions, and the corner stone of modular programming. In deterministic algorithms, implemented linearizable methods can be assumed to be atomic. But when processes can make random choices, the situation is not the same: Probability distributions of outcomes of algorithms using linearizable methods may be very different from those using equivalent atomic operations [4]. In general, modular algorithm design is much more difficult for randomized algorithms than for deterministic ones. The first part of the talk will present a correctness condition [2, 5] that is suitable for randomized algorithms in certain settings, and will explain why in other settings no such correctness condition exists [3] and what we can do about that. To this date, almost all randomized shared memory algorithms are Las Vegas, meaning they permit no error. Monte Carlo algorithms, which allow errors to occur with small probability, have been studied thoroughly for sequential systems. But in the shared memory world such algorithms have been neglected. The second part of this talk will discuss recent attempts to devise Monte Carlo algorithms for fundamental shared memory problems (e.g., [1]). It will also present some general techniques, that have proved useful in the design of concurrent randomized algorithms.","PeriodicalId":153766,"journal":{"name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128917340","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

Strongly Linearizable Implementations of Snapshots and Other Types 快照和其他类型的强线性化实现

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2019-07-16 DOI: 10.1145/3293611.3331632

Sean Ovens, Philipp Woelfel

{"title":"Strongly Linearizable Implementations of Snapshots and Other Types","authors":"Sean Ovens, Philipp Woelfel","doi":"10.1145/3293611.3331632","DOIUrl":"https://doi.org/10.1145/3293611.3331632","url":null,"abstract":"Linearizability is the gold standard of correctness conditions for shared memory algorithms, and historically has been considered the practical equivalent of atomicity. However, it has been shown that replacing atomic objects with linearizable implementations can affect the probability distribution of execution outcomes in randomized algorithms. Thus, linearizable objects are not always suitable replacements for atomic objects. A stricter correctness condition called strong linearizability has been developed and shown to be appropriate for randomized algorithms in a strong adaptive adversary model[16]. We devise several new lock-free strongly linearizable implementations from atomic registers. In particular, we give the first strongly linearizable lock-free snapshot implementation that uses bounded space. This improves on the unbounded space solution of Denysyuk and Woelfel[14]. As a building block, our algorithm uses a lock-free strongly linearizable ABA-detecting register. We obtain this object by modifying the wait-free linearizable ABA-detecting register of Aghazadeh and Woelfel [5], which, as we show, is not strongly linearizable. Aspnes and Herlihy[8] identified a wide class of types that have wait-free linearizable implementations. These types require that any pair of operations either commute, or one overwrites the other. Aspnes and Herlihy gave a general wait-free linearizable implementation of such types, employing an atomic snapshot object. We show that this implementation is strongly linearizable, proving that all types in this class have a lock-free strongly linearizable implementation from atomic registers.","PeriodicalId":153766,"journal":{"name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127411151","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

Central Control over Distributed Asynchronous Systems: A Tutorial on Software-Defined Networks and Consistent Network Updates 分布式异步系统的中央控制:软件定义网络和一致网络更新教程

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2019-07-16 DOI: 10.1145/3293611.3338024

Klaus-Tycho Foerster

{"title":"Central Control over Distributed Asynchronous Systems: A Tutorial on Software-Defined Networks and Consistent Network Updates","authors":"Klaus-Tycho Foerster","doi":"10.1145/3293611.3338024","DOIUrl":"https://doi.org/10.1145/3293611.3338024","url":null,"abstract":"This tutorial will give an introduction to a topic that lies at the intersection of distributed computing and networking, and combines asynchronous distributed systems with central control, namely consistent updates in Software-Defined Networks (SDNs). We will give an overview on current models and algorithms, but also selected related topics, in particular those of potential interest to the PODC community, showcasing avenues for further research. In more detail, SDNs have been an intensively studied topic in networking over the last years, but much of its focus has been on (logical) central control, abstracting away most of its underlying foundation, namely that a network is still a distributed asynchronous system at its core. Summarized in a simplified way, SDNs come with the promise that the network state can be optimized and updated from a global point of view. However, such a simplification becomes especially problematic when consistency guarantees have to maintained. In asynchronous distributed systems, it is not possible to simultaneously change the state of all nodes, such a naive approach will lead to an inconsistent mix of old and new states, introducing e.g. forwarding loops. Notwithstanding, most approaches tackle these issues from the viewpoints of the networking/systems communities, and we believe could henceforth greatly benefit from connections to and ideas from the PODC community.","PeriodicalId":153766,"journal":{"name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","volume":"179 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126764786","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

On Site Fidelity and the Price of Ignorance in Swarm Robotic Central Place Foraging Algorithms 群机器人中心地觅食算法中的站点保真度和无知的代价

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2019-07-16 DOI: 10.1145/3293611.3331572

Abhinav Aggarwal, G. M. Fricke, Diksha Gupta, M. Moses

引用次数: 5

Bootstrapping Public Blockchains Without a Trusted Setup 在没有可信设置的情况下引导公共区块链

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing Pub Date : 2019-07-16 DOI: 10.1145/3293611.3331570

Abhinav Aggarwal, Mahnush Movahedi, Jared Saia, M. Zamani

引用次数: 6