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

Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions 精确多数共识的人口协议:小的失败机会如何有助于消除无关紧要的意见

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

Gregor Bankhamer, P. Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling

{"title":"Population Protocols for Exact Plurality Consensus: How a small chance of failure helps to eliminate insignificant opinions","authors":"Gregor Bankhamer, P. Berenbrink, Felix Biermeier, Robert Elsässer, Hamed Hosseinpour, Dominik Kaaser, Peter Kling","doi":"10.1145/3519270.3538447","DOIUrl":"https://doi.org/10.1145/3519270.3538447","url":null,"abstract":"We consider the plurality consensus problem for population protocols. Here, n anonymous agents start each with one of k opinions. Their goal is to agree on the initially most frequent opinion (the plurality opinion) via random, pairwise interactions. Exact plurality consensus refers to the requirement that the plurality opinion must be identified even if the bias (difference between the most and second most frequent opinion) is only 1. The case of k = 2 opinions is known as the majority problem. Recent breakthroughs led to an always correct, exact majority population protocol that is both time- and space-optimal, needing O(logn) states per agent and, with high probability, O(logn) time [Doty, Eftekhari, Gasieniec, Severson, Uznanski, and Stachowiak; 2021]. Meanwhile, results for general plurality consensus are rare and far from optimal. We know that any always correct protocol requires Ω(k2) states, while the currently best protocol needs O(k11) states [Natale and Ramezani; 2019]. For ordered opinions, this can be improved to O(k6) [Gasieniec, Hamilton, Martin, Spirakis, and Stachowiak; 2016].","PeriodicalId":182444,"journal":{"name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","volume":"54 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":"116454460","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: Fault Tolerant Coloring of the Asynchronous Cycle 简要公告:异步循环的容错着色

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

P. Fraigniaud, Patrick Lambein-Monette, M. Rabie

引用次数: 0

Brief Announcement: The Weakest Failure Detector for Genuine Atomic Multicast 简短声明:最弱的故障检测器用于真正的原子组播

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

P. Sutra

引用次数: 1

Revisiting the Power of Non-Equivocation in Distributed Protocols 重新审视分布式协议中无歧义性的力量

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

N. Ben-David, Benjamin Y. Chan, Elaine Shi

引用次数: 3

Brief Announcement: Computability and Anonymous Storage-Efficient Consensus with an Abstract MAC Layer 简要公告:具有抽象MAC层的可计算性和匿名存储效率共识

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

Lewis Tseng, Qinzi Zhang

引用次数: 0

The Space Complexity of Consensus from Swap 交换共识的空间复杂度

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

Sean Ovens

{"title":"The Space Complexity of Consensus from Swap","authors":"Sean Ovens","doi":"10.1145/3519270.3538420","DOIUrl":"https://doi.org/10.1145/3519270.3538420","url":null,"abstract":"Nearly thirty years ago, it was shown that Ω(√n ) read/write registers are needed to solve obstruction-free consensus among n processes. This lower bound was improved to n registers in 2018, which exactly matches the best upper bound. The Ømega (√n) space complexity lower bound actually applies to a class of objects called historyless objects, which includes read/write registers, test-and-set objects, and readable swap objects. However, every known n-process obstruction-free consensus algorithm from historyless objects uses Ω(n) objects. In this paper, we give the first Ω(n) space complexity lower bounds for two kinds of historyless objects. First, we show that any obstruction-free consensus algorithm from swap objects uses at least n-1 objects. We also present an obstruction-free consensus algorithm from n-1 swap objects, exactly matching our lower bound. To our knowledge, this is the first consensus algorithm from swap objects that do not also support the Read operation. Second, we show that any obstruction-free binary consensus algorithm from readable binary swap objects uses at least n - 2 objects. The best known obstruction-free binary consensus algorithm from readable binary swap objects uses 2n-1 objects, which shows that our lower bound is asymptotically tight. Since any historyless object can be simulated by a readable swap object with the same domain, our results imply that any obstruction-free consensus algorithm from binary historyless objects uses at least n - 2 objects.","PeriodicalId":182444,"journal":{"name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","volume":"51 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":"122995739","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

A Distributed Combinatorial Topology Approach to Arrow's Impossibility Theorem 阿罗不可能定理的一种分布式组合拓扑方法

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

S. Rajsbaum, A. Raventós-Pujol

引用次数: 3

How Should We Think about Persistent Data Structures? 我们应该如何看待持久数据结构?

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

M. Scott

{"title":"How Should We Think about Persistent Data Structures?","authors":"M. Scott","doi":"10.1145/3519270.3538455","DOIUrl":"https://doi.org/10.1145/3519270.3538455","url":null,"abstract":"For machines with nonvolatile memory (NVM) but volatile caches, most work on persistent data structures has assumed that every operation must be guaranteed to survive any crash that occurs after returning to the caller. Most programmers, however, don't want to persist existing transient structures: they want to avoid serializing and deserializing structures traditionally kept in block-structured files and databases. For these, programmers are accustomed to buffered semantics, which allow persistence to be delayed-either for a brief period of time or until the execution of an explicit sync operation. Experiments with Rochester's Montage system confirm that buffered persistence can approach the performance of non-persistent structures placed in NVM-arguably the best one could hope for, and dramatically faster than systems with stricter semantics. As NVM proliferates, there will be more and more opportunities to soften the traditional boundary between (transient, byte-addressable) memory and (persistent, block-structured) storage. As we seek to formalize the development of persistent data structures, the PODC/DISC community will want to con-sider not only alternative correctness criteria, but also evolving hardware characteristics. Issues to be considered include the choice between evicting and non-evicting write-back, the introduction of nonvolatile caches, and the possibility that NVM bandwidth and latency may vary greatly with access granularity, locality, and concurrent DRAM activity.","PeriodicalId":182444,"journal":{"name":"Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing","volume":"2 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":"121529035","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

Brief Announcement: Broadcasting Time in Dynamic Rooted Trees is Linear 简短公告:动态根树的广播时间是线性的

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

Antoine El-Hayek, M. Henzinger, Stefan Schmid

引用次数: 4

Brief Announcement: Deterministic Massively Parallel Algorithms for Ruling Sets 简要公告:统治集的确定性大规模并行算法

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

Shreyas Pai, S. Pemmaraju

引用次数: 2