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

Secure Distributed Computing Made (Nearly) Optimal 安全分布式计算(接近)最优

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

M. Parter, E. Yogev

{"title":"Secure Distributed Computing Made (Nearly) Optimal","authors":"M. Parter, E. Yogev","doi":"10.1145/3293611.3331620","DOIUrl":"https://doi.org/10.1145/3293611.3331620","url":null,"abstract":"In this paper, we study secure distributed algorithms that are nearly optimal, with respect to running time, for the given input graph G. Roughly speaking, an algorithm is secure if the nodes learn only their final output while gaining no information on the input (or output) of other nodes. A graph theoretic framework for secure distributed computation was recently introduced by the authors (SODA 2019). This framework is quite general and it is based on a new combinatorial structure called private neighborhood trees : a collection of n trees T(u1), …, T(un) such that each tree T(ui) spans the neighbors of ui without going through ui. Intuitively, each tree T(ui) allows all neighbors of ui to exchange a secret that is hidden from ui. The efficiency of the framework depends on two key parameters of these trees: their depth and the amount of overlap. In a (d,c)-private neighborhood trees each tree T(ui) has depth O(d) and each edge e ∈ G appears in at most O(c) different trees. An existentially optimal construction of private neighborhood trees with d=O(Δ … D) and c=Õ (D) was presented therein. We make two key contributions: Universally Optimal Private Trees: We show a combinatorial construction of nearly (universally) optimal (d,c)-private neighborhood trees with d + c=Õ (OPT(G)) for any input graph G. Perhaps surprisingly, we show that OPT(G) is equal to the best depth possible for these trees even without the congestion constraint. We also present efficient distributed constructions of these private trees. Optimal Secure Computation: Using the optimal constructions above, we get a secure compiler for distributed algorithms where the overhead for each round is Õ (poly(Δ)… OPT(G)). As our second key contribution, we design an optimal compiler with an overhead of merely Õ (OPT(G)) per round for a class of \"simple\" algorithms. This class includes many standard distributed algorithms such as Luby-MIS, the standard logarithmic-round algorithms for matching and Δ + 1-coloring, as well as the computation of aggregate functions.","PeriodicalId":153766,"journal":{"name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","volume":"51 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":"121670035","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

Randomized Concurrent Set Union and Generalized Wake-Up 随机并发集并集与广义唤醒

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

S. Jayanti, R. Tarjan, Enric Boix-Adserà

{"title":"Randomized Concurrent Set Union and Generalized Wake-Up","authors":"S. Jayanti, R. Tarjan, Enric Boix-Adserà","doi":"10.1145/3293611.3331593","DOIUrl":"https://doi.org/10.1145/3293611.3331593","url":null,"abstract":"We consider the disjoint set union problem in the asynchronous shared memory multiprocessor computation model. We design a randomized algorithm that performs at most O(log n) work per operation (with high probability), and performs at most O(m #8226; (α(n, m/(np)) + log(np/m + 1)) total work in expectation for a problem instance with m operations on n elements solved by p processes. Our algorithm is the first to have work bounds that grow sublinearly with p against an adversarial scheduler. We use Jayanti's Wake Up problem and our newly defined Generalized Wake Up problem to prove several lower bounds on concurrent set union. We show an Ω(log min {n,p}) expected work lower bound on the cost of any single operation on a set union algorithm. This shows that our single-operation upper bound is optimal across all algorithms when p = nΩ(1). Furthermore, we identify a class of \"symmetric algorithms'' that captures the complexities of all the known algorithms for the disjoint set union problem, and prove an Ω(m•(α(n, m(np)) + log(np/m + 1))) expected total work lower bound on algorithms of this class, thereby showing that our algorithm has optimal total work complexity for this class. Finally, we prove that any randomized algorithm, symmetric or not, cannot breach an Ω(m •(α(n, m/n) + log log(np/m + 1))) expected total work lower bound.","PeriodicalId":153766,"journal":{"name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","volume":"8 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120982497","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

Message Reduction in the LOCAL Model is a Free Lunch 消息缩减在LOCAL模型中是免费的午餐

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

Shimon Bitton, Y. Emek, Taisuke Izumi, S. Kutten

引用次数: 2

Asymptotically Optimal Validated Asynchronous Byzantine Agreement 渐近最优验证异步拜占庭协议

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

Ittai Abraham, D. Malkhi, A. Spiegelman

引用次数: 135

Tutorial 教程

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

Diego Cepeda, Sakib Chowdhury, W. Golab

引用次数: 0

HotStuff

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

Maofan Yin, D. Malkhi, M. Reiter, Guy Golan Gueta, Ittai Abraham

引用次数: 633

Local Computation Algorithms 局部计算算法

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

Shai Vardi, Ning Xie

引用次数: 2

2019 Edsger W. Dijkstra Prize in Distributed Computing 2019年Edsger W. Dijkstra分布式计算奖

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

L. Alvisi, S. Dolev, Faith Ellen, I. Keidar, F. Kuhn, J. Suomela

{"title":"2019 Edsger W. Dijkstra Prize in Distributed Computing","authors":"L. Alvisi, S. Dolev, Faith Ellen, I. Keidar, F. Kuhn, J. Suomela","doi":"10.1145/3293611.3341564","DOIUrl":"https://doi.org/10.1145/3293611.3341564","url":null,"abstract":"The committee decided to award the 2019 Edsger W. Dijkstra Prize in Distributed Computing to Alessandro Panconesi and Aravind Srinivasan for their paper Randomized Distributed Edge Coloring via an Extension of the Chernoff-Hoeffding Bounds, SIAM Journal on Computing, volume 26, number 2, 1997, pages 350-368. A preliminary version of this paper appeared as Fast Randomized Algorithms for Distributed Edge Coloring, Proceedings of the Eleventh Annual ACM Symposium Principles of Distributed Computing (PODC), 1992, pages 251-262. The paper presents a simple synchronous algorithm in which processes at the nodes of an undirected network color its edges so that the edges adjacent to each node have different colors. It is randomized, using 1.6Δ + O(log1+ζn) colors and O(log n) rounds with high probability for any constant ζ>0, where n is the number of nodes and is the maximum degree of the nodes. This was the first nontrivial distributed algorithm for the edge coloring problem and has influenced a great deal of follow-up work. Edge coloring has applications to many other problems in distributed computing such as routing, scheduling, contention resolution, and resource allocation. In spite of its simplicity, the analysis of their edge coloring algorithm is highly nontrivial. Chernoff-Hoeffding bounds, which assume random variables to be independent, cannot be used. Instead, they develop upper bounds for sums of negatively correlated random variables, for example, which arise when sampling without replacement. More generally, they extend Chernoff-Hoeffding bounds to certain random variables they call λ-correlated. This has directly inspired more specialized concentration inequalities. The new techniques they introduced have also been applied to the analyses of important randomized algorithms in a variety of areas including optimization, machine learning, cryptography, streaming, quantum computing, and mechanism design.","PeriodicalId":153766,"journal":{"name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","volume":"11 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":"128239895","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

P-SLOCAL-Completeness of Maximum Independent Set Approximation 极大独立集逼近的p - slocal完备性

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

Yannic Maus

引用次数: 0

Engineering Distributed Systems that We Can Trust (and Also Run) 工程分布式系统，我们可以信任(也可以运行)

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

Ilya Sergey

引用次数: 2