Geometric and combinatorial views on asynchronous computability
DOI10.1007/s00446-018-0328-4zbMath1451.68046OpenAlexW2789995574MaRDI QIDQ1657197
Christine Tasson, Samuel Mimram, Eric Goubault
Publication date: 13 August 2018
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-02155487/file/mimram_views.pdf
interval orderdihomotopydirected algebraic topologyfault-tolerant distributed computingatomic snapshot protocolprotocol complex
Semantics in the theory of computing (68Q55) Distributed systems (68M14) Simplicial sets and complexes in algebraic topology (55U10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network protocols (68M12)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A geometric view of partial order reduction
- Iterated chromatic subdivisions are collapsible
- Some geometric perspectives in concurrency theory
- Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract)
- Chromatic subdivision of a simplicial complex
- Composite registers
- Algebraic topology and concurrency
- Directed algebraic topology and concurrency. With a foreword by Maurice Herlihy and a preface by Samuel Mimram
- Intransitive indifference with unequal indifference intervals
- The Read/Write Protocol Complex Is Collapsible
- Trace Spaces: An Efficient New Technique for State-Space Reduction
- The topological structure of asynchronous computability
- Impossibility of distributed consensus with one faulty process
- Atomic snapshots of shared memory
- Term Rewriting and All That
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Wait-free k-set agreement is impossible
- The asynchronous computability theorem for t-resilient tasks
- CONCUR 2005 – Concurrency Theory
This page was built for publication: Geometric and combinatorial views on asynchronous computability
