A Characterization of t-Resilient Colorless Task Anonymous Solvability - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2018

A Characterization of t-Resilient Colorless Task Anonymous Solvability


One of the central questions in distributed computability is characterizing the tasks that are solvable in a given system model. In the anonymous case, where processes have no identifiers and communicate through multi-writer/multi-reader registers, there is a recent topologi-cal characterization (Yanagisawa 2017) of the colorless tasks that are solvable when any number of asynchronous processes may crash. In this paper, we consider the case where at most t asynchronous processes may crash, where 1 ≤ t < n. We prove that a colorless task is t-resilient solvable anonymously if and only if it is t-resilient solvable non-anonymously. We obtain our results through various reductions and simulations that explore how to extend techniques for non-anonymous computation to anonymous one.
Fichier principal
Vignette du fichier
main.pdf (450.31 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01955837 , version 1 (14-12-2018)



Carole Delporte-Gallet, Hugues Fauconnier, Sergio Rajsbaum, Nayuta Yanagisawa. A Characterization of t-Resilient Colorless Task Anonymous Solvability. SIROCCO 2018 - 25th International Colloquium Structural Information and Communication Complexity, Jun 2018, Ma'ale HaHamisha, Israel. ⟨10.1007/978-3-030-01325-7_18⟩. ⟨hal-01955837⟩
54 View
126 Download



Gmail Facebook X LinkedIn More