From geometric semantics to asynchronous computability

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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 simplices of the protocol complex and dihomotopy classes of dipaths in the latter semantics, we describe a connection between these two geometric approaches: protocol complexes and directed algebraic topology. This is exemplified on atomic snapshot, iterated snapshot and layered immediate snapshot protocols, where a well-known combinatorial 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.

Original languageEnglish
Title of host publicationDistributed Computing - 29th International Symposium, DISC 2015, Proceedings
EditorsYoram Moses
PublisherSpringer Verlag
Pages436-451
Number of pages16
ISBN (Print)9783662486528
DOIs
Publication statusPublished - 1 Jan 2015
Event29th International Symposium on Distributed Computing, DISC 2015 - Tokyo, Japan
Duration: 7 Oct 20159 Oct 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9363
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference29th International Symposium on Distributed Computing, DISC 2015
Country/TerritoryJapan
CityTokyo
Period7/10/159/10/15

Fingerprint

Dive into the research topics of 'From geometric semantics to asynchronous computability'. Together they form a unique fingerprint.

Cite this