Two Convergence Problems for Robots on Graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Two Convergence Problems for Robots on Graphs

Résumé

The class of robot convergence tasks has been shown to capture fundamental aspects of fault-tolerant computability. A set of asynchronous robots that may fail by crashing, start from unknown places in some given space, and have to move towards positions close to each other. In this article, we study the case where the space is uni-dimensional, modeled as a graph G. In graph convergence, robots have to end up on one or two vertices of the same edge. We consider also a variant of robot convergence on graphs, edge covering, where additionally it is required that not all robots end up on the same vertex. Remarkably, these two similar problems have very different computability properties, related to orthogonal fundamental issues of distributed computations: agreement and symmetry breaking. We characterize the graphs on which each of these problems is solvable, and give optimal time algorithms for the solvable cases. Although the results can be derived from known general topology theorems, the presentation serves as a self-contained introduction to the topology approach to distributed computing, and yields concrete algorithms and impossibility results.
Fichier principal
Vignette du fichier
wait-free-graph-problems.pdf (601.87 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01386628 , version 1 (24-10-2016)

Identifiants

Citer

Armando Castañeda, Sergio Rajsbaum, Matthieu Roy. Two Convergence Problems for Robots on Graphs. 7th IEEE Latin-American Symposium on Dependable Computing, Oct 2016, Cali, Colombia. ⟨10.1109/LADC.2016.21⟩. ⟨hal-01386628⟩
117 Consultations
207 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More