A Topological Perspective on Distributed Network Algorithms - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Theoretical Computer Science Année : 2019

A Topological Perspective on Distributed Network Algorithms

Résumé

More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems. In this work, we show that combinatorial topology can also be useful for analyzing distributed algorithms in networks of arbitrary structure. To illustrate this, we analyze consensus, set-agreement, and approximate agreement in networks, and derive lower bounds for these problems under classical computational settings, such as the LOCAL model and dynamic networks.

Dates et versions

hal-02433511 , version 1 (09-01-2020)

Identifiants

Citer

Armando Castañeda, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum, Matthieu Roy, et al.. A Topological Perspective on Distributed Network Algorithms. 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), Jul 2019, L'Aquila, Italy. ⟨10.1007/978-3-030-24922-9_1⟩. ⟨hal-02433511⟩
108 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More