Proceedings of the 39th Symposium on Principles of Distributed Computing最新文献

Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set 简要公告:改进的最大权重独立集的分布近似

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-07-31 DOI: 10.1145/3382734.3405728

K. Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman

{"title":"Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set","authors":"K. Kawarabayashi, Seri Khoury, Aaron Schild, Gregory Schwartzman","doi":"10.1145/3382734.3405728","DOIUrl":"https://doi.org/10.1145/3382734.3405728","url":null,"abstract":"We present improved algorithms for approximating maximum-weight independent set (MaxIS) in the CONGEST model. Given an input graph, let n and Δ be the number of nodes and maximum degree, respectively, and let MIS(n, Δ) be the running time of finding a maximal independent set (MIS) in the CONGEST model. Bar-Yehuda et al. [PODC 2017] showed that there is an algorithm in the CONGEST model that finds a Δ-approximation for MaxIS in O(MIS(n, Δ) log W) rounds, where W is the maximum weight of a node in the graph, which can be as high as poly(n). Whether their algorithm is deterministic or randomized depends on the MIS algorithm that is used as a black-box. Our results: (1) A deterministic O(MIS(n, Δ)/∈)-round algorithm that finds a (1 + ∈)Δ-approximation for MaxIS in the CONGEST model. (2) A randomized (poly(log log n)/∈)-round algorithm that finds, with high probability, a (1 + ∈)Δ-approximation for MaxIS in the CONGEST model. That is, by sacrificing only a tiny fraction of the approximation guarantee, we achieve an exponential speed-up in the running time over the previous best known result.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129968402","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}

引用次数: 1

Simple, Deterministic, Constant-Round Coloring in the Congested Clique 拥挤团中的简单、确定性、常圆着色

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-07-31 DOI: 10.1145/3382734.3405751

A. Czumaj, Peter Davies, M. Parter

{"title":"Simple, Deterministic, Constant-Round Coloring in the Congested Clique","authors":"A. Czumaj, Peter Davies, M. Parter","doi":"10.1145/3382734.3405751","DOIUrl":"https://doi.org/10.1145/3382734.3405751","url":null,"abstract":"We settle the complexity of the (Δ + 1)-coloring and (Δ + 1)-list coloring problems in the CONGESTED CLIQUE model by presenting a simple deterministic algorithm for both problems running in a constant number of rounds. This matches the complexity of the recent breakthrough randomized constant-round (Δ + 1)-list coloring algorithm due to Chang et al. (PODC'19), and significantly improves upon the state-of-the-art O(log Δ)-round deterministic (Δ + 1)-coloring bound of Parter (ICALP'18). A remarkable property of our algorithm is its simplicity. Whereas the state-of-the-art randomized algorithms for this problem are based on the quite involved local coloring algorithm of Chang et al. (STOC'18), our algorithm can be described in just a few lines. At a high level, it applies a careful derandomization of a recursive procedure which partitions the nodes and their respective palettes into separate bins. We show that after O(1) recursion steps, the remaining uncolored subgraph within each bin has linear size, and thus can be solved locally by collecting it to a single node. This algorithm can also be implemented in the Massively Parallel Computation (MPC) model provided that each machine has linear (in n, the number of nodes in the input graph) space. We also show an extension of our algorithm to the MPC regime in which machines have sublinear space: we present the first deterministic (Δ + 1)-list coloring algorithm designed for sublinear-space MPC, which runs in O(log Δ + log log n) rounds.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132615788","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}

引用次数: 19

Brief Announcement: On Using Null Messages in a Byzantine Setting 简短公告:关于在拜占庭设置中使用空消息

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-07-31 DOI: 10.1145/3382734.3405717

G. Goren, Y. Moses

引用次数: 0

Noisy Beeps 嘈杂的哔哔声

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-07-31 DOI: 10.1145/3382734.3404501

Klim Efremenko, Gillat Kol, Raghuvansh R. Saxena

引用次数: 7

Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement 简短公告:使用快照和点阵协议的应用程序在持续的客户端进行收集

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-07-31 DOI: 10.1145/3382734.3405709

H. Attiya, S. Kumari, Archit Somani, J. Welch

引用次数: 0

Brief Announcement: Intermediate Value Linearizability: A Quantitative Correctness Criterion 简要公告:中间值线性化:定量正确性标准

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-07-31 DOI: 10.1145/3382734.3405712

Arik Rinberg, I. Keidar

{"title":"Brief Announcement: Intermediate Value Linearizability: A Quantitative Correctness Criterion","authors":"Arik Rinberg, I. Keidar","doi":"10.1145/3382734.3405712","DOIUrl":"https://doi.org/10.1145/3382734.3405712","url":null,"abstract":"A common correctness criterion for concurrent objects is linearizability. Intuitively, under linearizability, when a read overlaps an update, it must return either the object's value before the update or the value after it. Consider, for example, a batched counter supporting \"batched\" increments, and a single operation that bumps its value from 7 to 10. A read overlapping this update is allowed to return either 7 or 10. In this paper, we propose Intermediate Value Linearizability (IVL), a new correctness criterion that relaxes linearizability to allow returning intermediate values, for instance, 8 in the example above. IVL is applicable to objects whose return values are from a totally ordered set. Roughly speaking, it allows reads to return any value that is bounded between two return values that are legal under linearizability. We show that this added degree of freedom inherently allows for cheaper implementations than linearizability. In particular, we show a lower bound of Ω(n) on the step complexity of the update operation of a wait-free linearizable batched counter, and give a wait-free IVL implementation of the same object with an O(1) step complexity for update.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133211205","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}

引用次数: 1

Massively Parallel Algorithms for Minimum Cut 最小割量的大规模并行算法

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-07-31 DOI: 10.1145/3382734.3405737

M. Ghaffari, Krzysztof Nowicki

引用次数: 9

From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems 从Bezout恒等式到匿名存储系统的空间最优选择

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-07-31 DOI: 10.1145/3382734.3405727

Emmanuel Godard, Damien Imbs, M. Raynal, G. Taubenfeld

{"title":"From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems","authors":"Emmanuel Godard, Damien Imbs, M. Raynal, G. Taubenfeld","doi":"10.1145/3382734.3405727","DOIUrl":"https://doi.org/10.1145/3382734.3405727","url":null,"abstract":"An anonymous shared memory REG can be seen as an array of atomic registers such that there is no a priori agreement among the processes on the names of the registers. As an example a very same physical register can be known as REG[x] by a process p and as REG[y] (where y ≠ x) by another process q. Moreover, the register known as REG[a] by a process p and the register known as REG[b] by a process q can be the same physical register. It is assumed that each process has a unique identifier that can only be compared for equality. This article is on solving the d-election problem, in which it is required to elect at least one and at most d leaders, in such an anonymous shared memory system. We notice that the 1-election problem is the familiar leader election problem. Let n be the number of processes and m the size of the anonymous memory (number of atomic registers). The article shows that the condition gcd(m, n) ≤ d is necessary and sufficient for solving the d-election problem, where communication is through read/write or read+modify+write registers. The algorithm used to prove the sufficient condition relies on Bezout's Identity - a Diophantine equation relating numbers according to their Greatest Common Divisor. Furthermore, in the process of proving the sufficient condition, it is shown that 1-leader election can be solved using only a single read/write register (which refutes a 1989 conjecture stating that three non-anonymous registers are necessary), and that the exact d-election problem, where exactly d leaders must be elected, can be solved if and only if gcd(m, n) divides d.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121245634","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

Self-Stabilizing Leader Election in Regular Graphs 正则图中的自稳定领袖选举

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-07-31 DOI: 10.1145/3382734.3405733

Hsueh-Ping Chen, Ho-Lin Chen

引用次数: 9

Brief Announcement: Optimal Time and Space Leader Election in Population Protocols 简要公告:人口协议中的最优时空领袖选举

Proceedings of the 39th Symposium on Principles of Distributed Computing Pub Date : 2020-07-31 DOI: 10.1145/3382734.3405726

P. Berenbrink, George Giakkoupis, Peter Kling

{"title":"Brief Announcement: Optimal Time and Space Leader Election in Population Protocols","authors":"P. Berenbrink, George Giakkoupis, Peter Kling","doi":"10.1145/3382734.3405726","DOIUrl":"https://doi.org/10.1145/3382734.3405726","url":null,"abstract":"Population protocols are a model of distributed computing, where n agents with limited computational power and memory perform randomly scheduled pairwise interactions. Recently, a significant amount of work has been devoted to the study of the time and space complexity of leader election in this model. It is known that Ω (log log n) states per agent are needed to elect a leader in fewer than [EQUATION] expected interactions (Alistarh et al.; SODA'17) and that Ω (n log n) expected interactions are required regardless of the number of states (Sudo and Masuzawa; 2020). On the positive side, Gasieniec and Stachowiak (SODA'18) gave the first protocol that uses an optimal Θ(log log n) number or states and elects a leader in O(n log2 n) expected interactions. This running time was subsequently improved to O(n log n log log n) (Gasieniec et al.; SPAA'19). We provide the first leader election population protocol that is both time and space optimal, electing a leader in O(n log n) expected interactions and using Θ(log log n) states per agent. A novel component is a simple protocol that efficiently selects a small set of agents of polylog n size, given O(n∈) initially selected agents. Unlike existing approaches, which monotonically shrink this initially selected set, we first grow it in a controlled way to a specific size before shrinking it again.","PeriodicalId":222366,"journal":{"name":"Proceedings of the 39th Symposium on Principles of Distributed Computing","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114284135","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