License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.DISC.2023.46
URN: urn:nbn:de:0030-drops-191725
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/19172/
Go to the corresponding LIPIcs Volume Portal

Ovens, Sean

Brief Announcement: The Space Complexity of Set Agreement Using Swap

pdf-format:
LIPIcs-DISC-2023-46.pdf (0.5 MB)

Abstract

We prove that any randomized wait-free n-process k-set agreement algorithm using only swap objects requires at least ⌈n/k⌉-1 objects. We also sketch a proof that any randomized wait-free consensus algorithm using only readable swap objects with domain size b requires at least (n-2)/(3b+1) objects.

BibTeX - Entry

@InProceedings{ovens:LIPIcs.DISC.2023.46,
  author =	{Ovens, Sean},
  title =	{{Brief Announcement: The Space Complexity of Set Agreement Using Swap}},
  booktitle =	{37th International Symposium on Distributed Computing (DISC 2023)},
  pages =	{46:1--46:6},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-301-0},
  ISSN =	{1868-8969},
  year =	{2023},
  volume =	{281},
  editor =	{Oshman, Rotem},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2023/19172},
  URN =		{urn:nbn:de:0030-drops-191725},
  doi =		{10.4230/LIPIcs.DISC.2023.46},
  annote =	{Keywords: space complexity, consensus, set agreement, lower bound, shared memory}
}

Keywords: space complexity, consensus, set agreement, lower bound, shared memory
Collection: 37th International Symposium on Distributed Computing (DISC 2023)
Issue Date: 2023
Date of publication: 05.10.2023

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI