Geometric and combinatorial views on asynchronous computability - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Distributed Computing Year : 2018

Geometric and combinatorial views on asynchronous computability

Eric Goubault
  • Function : Author
  • PersonId : 840326
Christine Tasson
  • Function : Author
  • PersonId : 865456


We show that the protocol complex formalization of fault-tolerant protocols can be directly derived from a suitable semantics of the underlying synchronization and communication primitives, based on a geometrization of the state space. By constructing a one-to-one relationship between sim-plices of the protocol complex and (di)homotopy classes of (di)paths in the latter semantics, we describe a connection between these two geometric approaches to distributed computing: protocol complexes and directed algebraic topology. This is exemplified on atomic snapshot, iterated snapshot and layered immediate snapshot protocols, where a well-known com-binatorial structure, interval orders, plays a key role. We believe that this correspondence between models will extend to proving impossibility results for much more intricate fault-tolerant distributed architectures.
Fichier principal
Vignette du fichier
mimram_views.pdf (623.12 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02155487 , version 1 (13-06-2019)



Eric Goubault, Samuel Mimram, Christine Tasson. Geometric and combinatorial views on asynchronous computability. Distributed Computing, 2018, 31 (4), pp.289-316. ⟨10.1007/s00446-018-0328-4⟩. ⟨hal-02155487⟩
69 View
108 Download



Gmail Facebook Twitter LinkedIn More