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

A Massively Parallel Modularity-Maximizing Algorithm with Provable Guarantees 具有可证明保证的大规模并行模块化最大化算法

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing Pub Date : 2022-07-20 DOI: 10.1145/3519270.3538449

Vincent Cohen-Addad, Frederik Mallmann-Trenn, David Saulpic

引用次数: 2

Brief Announcement: On Polynomial-Time Local Decision 简要公告:关于多项式时间局部决策

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing Pub Date : 2022-07-20 DOI: 10.1145/3519270.3538463

Eden Aldema Tshuva, R. Oshman

引用次数: 1

2022 Principles of Distributed Computing Doctoral Dissertation Award 2022年《分布式计算原理》博士论文奖

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing Pub Date : 2022-07-20 DOI: 10.1145/3519270.3538412

Y. Afek, K. Censor-Hillel, P. Fraigniaud, Seth Gilbert, Gopal Pandurangan, G. Taubenfeld

引用次数: 0

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

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing Pub Date : 2022-07-20 DOI: 10.1145/3519270.3538411

Marcos Aguiliera, A. Richa, A. Schwarzmann, A. Panconesi, C. Scheideler, Philipp Woelfel

引用次数: 0

Massively Parallel Computation in a Heterogeneous Regime 异构环境下的大规模并行计算

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing Pub Date : 2022-07-20 DOI: 10.1145/3519270.3538450

O. Fischer, A. Horowitz, R. Oshman

{"title":"Massively Parallel Computation in a Heterogeneous Regime","authors":"O. Fischer, A. Horowitz, R. Oshman","doi":"10.1145/3519270.3538450","DOIUrl":"https://doi.org/10.1145/3519270.3538450","url":null,"abstract":"Massively-parallel graph algorithms have received extensive attention over the past decade, with research focusing on three memory regimes: the superlinear regime, the near-linear regime, and the sublinear regime. The sublinear regime is the most desirable in practice, but conditional hardness results point towards its limitations. In this work we study a heterogeneous model, where the memory of the machines varies in size. We focus mostly on the heterogeneous setting created by adding a single near-linear machine to the sublinear MPC regime, and show that even a single large machine suffices to circumvent most of the conditional hardness results for the sublinear regime: for graphs with n vertices and m edges, we give (a) an MST algorithm that runs in O(łogłog(m/n)) rounds; (b) an algorithm that constructs an O(k)-spanner of size O(n^1+1/k ) in O(1) rounds; and (c) a maximal-matching algorithm that runs in O(√łog(m/n) łogłog(m/n)) rounds. We also observe that the best known near-linear MPC algorithms for several other graph problems which are conjectured to be hard in the sublinear regime (minimum cut, maximal independent set, and vertex coloring) can easily be transformed to work in the heterogeneous MPC model with a single near-linear machine, while retaining their original round complexity in the near-linear regime. If the large machine is allowed to have superlinear memory, all of the problems above can be solved in O(1) rounds.","PeriodicalId":182444,"journal":{"name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128389892","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

Encrypted Distributed Systems 加密分布式系统

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing Pub Date : 2022-07-20 DOI: 10.1145/3519270.3538454

S. Kamara

引用次数: 0

Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation 具有近最优通信和改进计算的平衡拜占庭可靠广播

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing Pub Date : 2022-07-20 DOI: 10.1145/3519270.3538475

Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang

{"title":"Balanced Byzantine Reliable Broadcast with Near-Optimal Communication and Improved Computation","authors":"Nicolas Alhaddad, Sourav Das, Sisi Duan, Ling Ren, Mayank Varia, Zhuolun Xiang, Haibin Zhang","doi":"10.1145/3519270.3538475","DOIUrl":"https://doi.org/10.1145/3519270.3538475","url":null,"abstract":"This paper studies Byzantine reliable broadcast (BRB) under asynchronous networks, and improves the state-of-the-art protocols from the following aspects. Near-optimal communication cost: We propose two new BRB protocols for n nodes and input message M that has communication cost O(n|M|+n2 logn), which is nearoptimal due to the lower bound of Ω(n|M|+n2). The first RBC protocol assumes threshold signature but is easy to understand, while the second RBC protocol is error-free but less intuitive. Improved computation:We propose a newconstruction that improves the computation cost of the state-of-the-art BRB by avoiding the expensive online error correction on the input message, while achieving the same communication cost. Balanced communication: We propose a technique named balanced multicast that can balance the communication cost for BRB protocols where the broadcaster needs to multicast the message M while other nodes only needs to multicast coded fragments of size O(|M|/n + logn). The balanced multicast technique can be applied to many existing BRB protocols as well as all our new constructions in this paper, and can make every node incur about the same communication cost. Finally, we present a lower bound to show the near optimality of our protocol in terms of communication cost at each node.","PeriodicalId":182444,"journal":{"name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127927434","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}

引用次数: 15

Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds 摘要:睡眠模型中的分布式MST计算:唤醒-最优算法和下界

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing Pub Date : 2022-07-20 DOI: 10.1145/3519270.3538459

John E. Augustine, W. Moses, Gopal Pandurangan

{"title":"Brief Announcement: Distributed MST Computation in the Sleeping Model: Awake-Optimal Algorithms and Lower Bounds","authors":"John E. Augustine, W. Moses, Gopal Pandurangan","doi":"10.1145/3519270.3538459","DOIUrl":"https://doi.org/10.1145/3519270.3538459","url":null,"abstract":"We study the distributed minimum spanning tree (MST) problem, a fundamental problem in distributed computing. It is well-known that distributed MST can be solved in Õ(D+√n) rounds in the standard CONGEST model (where n is the network size and D is the network diameter) and this is essentially the best possible round complexity (up to logarithmic factors). However, in resource-constrained networks such as wireless ad hoc and sensor networks, nodes spending so much time can lead to significant spending of resources such as energy. Motivated by the above consideration, we study distributed algorithms for MST under the sleeping model [Chatterjee et al., PODC 2020], a model for design and analysis of resource-efficient distributed algorithms. In the sleeping model, a node can be in one of two modes in any round --- sleeping or awake (unlike the traditional model where nodes are always awake). Only the rounds in which a node is awake are counted, while sleeping rounds are ignored. A node spends resources only in the awake rounds and hence the main goal is to minimize the awake complexity of a distributed algorithm, the worst-case number of rounds any node is awake. We present distributed MST algorithms that have optimal awake complexity with a matching lower bound. We also show that our awake-optimal algorithms have essentially the best possible round complexity by presenting a lower bound on the product of the awake and round complexity of any distributed algorithm (including randomized).","PeriodicalId":182444,"journal":{"name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116682803","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}

引用次数: 6

Brief Announcement: Asynchronous Randomness and Consensus without Trusted Setup 简短公告:异步随机性和无信任设置的共识

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing Pub Date : 2022-07-20 DOI: 10.1145/3519270.3538461

Luciano Freitas, P. Kuznetsov, Andrei Tonkikh

引用次数: 0

Constant-Round Near-Optimal Spanners in Congested Clique 拥挤群体中的恒圆近最优扳手

Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing Pub Date : 2022-07-20 DOI: 10.1145/3519270.3538439

S. Chechik, Tianyi Zhang

引用次数: 0