The Space Complexity of Consensus from Swap

Author:

Ovens Sean1

Affiliation:

1. University of Toronto, Canada

Abstract

Nearly thirty years ago, it was shown that \(\Omega (\sqrt {n}) \) read/write registers are needed to solve randomized wait-free consensus among n processes. This lower bound was improved to n registers in 2018, which exactly matches known algorithms. The \(\Omega (\sqrt {n}) \) space complexity lower bound actually applies to a class of objects called historyless objects, which includes 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 on consensus algorithms for two kinds of historyless objects. First, we show that any obstruction-free consensus algorithm from swap objects uses at least n − 1 objects. More generally, we prove that any obstruction-free k -set agreement algorithm from swap objects uses at least \(\lceil \frac{n}{k}\rceil - 1 \) objects. The k -set agreement problem is a generalization of consensus in which processes agree on no more than k different output values. This is the first non-constant lower bound on the space complexity of solving k -set agreement with swap objects when k > 1. We also present an obstruction-free k -set agreement algorithm from nk swap objects, which exactly matches our lower bound when k = 1. Second, we show that any obstruction-free binary consensus algorithm from readable swap objects with domain size b uses at least \(\frac{n-2}{3b+1} \) objects. When b is a constant, this asymptotically matches the best known obstruction-free consensus algorithms from readable swap objects with unbounded domains. 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 historyless objects with domain size b uses at least \(\frac{n-2}{3b+1} \) objects. For b = 2, we show a slightly better lower bound of n − 2. There is an obstruction-free binary consensus algorithm using 2 n − 1 readable swap objects with domain size 2, asymptotically matching our lower bound.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference26 articles.

1. Atomic snapshots of shared memory

2. James  H. Anderson . 1993. Composite registers. Distributed Computing 6, 3 (01 Apr 1993 ), 141–154. https://doi.org/10.1007/BF02242703 10.1007/BF02242703 James H. Anderson. 1993. Composite registers. Distributed Computing 6, 3 (01 Apr 1993), 141–154. https://doi.org/10.1007/BF02242703

3. Fast randomized consensus using shared memory

4. Hagit Attiya and Faith Ellen . 2014. Impossibility Results for Distributed Computing . Morgan & Claypool Publishers . https://doi.org/10.2200/S00551ED1V01Y 2013 11DCT012 10.2200/S00551ED1V01Y201311DCT012 Hagit Attiya and Faith Ellen. 2014. Impossibility Results for Distributed Computing. Morgan & Claypool Publishers. https://doi.org/10.2200/S00551ED1V01Y201311DCT012

5. Generalized FLP impossibility result for t-resilient asynchronous computations

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3