License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.OPODIS.2018.23
URN: urn:nbn:de:0030-drops-100830
URL: https://drops.dagstuhl.de/opus/volltexte/2018/10083/
Go to the corresponding LIPIcs Volume Portal

Kuznetsov, Petr ; Yanagisawa, Nayuta

Task Computability in Unreliable Anonymous Networks

pdf-format:
LIPIcs-OPODIS-2018-23.pdf (0.7 MB)

Abstract

We consider the anonymous broadcast model: a set of n anonymous processes communicate via send-to-all primitives. We assume that underlying communication channels are asynchronous but reliable, and that the processes are subject to crash failures. We show first that in this model, even a single faulty process precludes implementations of atomic objects with non-commuting operations, even as simple as read-write registers or add-only sets. We, however, show that a sequentially consistent read-write memory and add-only sets can be implemented t-resiliently for t<n/2, i.e., provided that a majority of the processes do not fail. We use this implementation to establish an equivalence between the t-resilient read-write anonymous shared-memory model and the t-resilient anonymous broadcast model in terms of colorless task solvability. As a result, we obtain the first task computability characterization for unreliable anonymous message-passing systems.

BibTeX - Entry

@InProceedings{kuznetsov_et_al:LIPIcs:2018:10083,
  author =	{Petr Kuznetsov and Nayuta Yanagisawa},
  title =	{{Task Computability in Unreliable Anonymous Networks}},
  booktitle =	{22nd International Conference on Principles of Distributed  Systems (OPODIS 2018)},
  pages =	{23:1--23:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-098-9},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{125},
  editor =	{Jiannong Cao and Faith Ellen and Luis Rodrigues and Bernardo Ferreira},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2018/10083},
  URN =		{urn:nbn:de:0030-drops-100830},
  doi =		{10.4230/LIPIcs.OPODIS.2018.23},
  annote =	{Keywords: Distributed tasks, anonymous broadcast, fault-tolerance}
}

Keywords: Distributed tasks, anonymous broadcast, fault-tolerance
Collection: 22nd International Conference on Principles of Distributed Systems (OPODIS 2018)
Issue Date: 2018
Date of publication: 15.01.2019

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