2026-08-10T13:31:22Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:10083 2024-03-06T10:45:34Z ddc:004 open_access

Task Computability in Unreliable Anonymous Networks Kuznetsov, Petr Yanagisawa, Nayuta Distributed tasks anonymous broadcast fault-tolerance 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Petr Kuznetsov and Nayuta Yanagisawa 2019 Is Part Of LIPIcs, Volume 125, 22nd International Conference on Principles of Distributed Systems (OPODIS 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2018.23 urn:nbn:de:0030-drops-100830 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2018.23 eng https://creativecommons.org/licenses/by/3.0/legalcode