Schlegel Diagram and Optimizable Immediate Snapshot Protocol

DOI10.4230/LIPIcs.OPODIS.2017.22zbMath1487.68049arXiv1711.07135OpenAlexW2962969803MaRDI QIDQ3300823

Susumu Nishimura

Publication date: 30 July 2020

Full work available at URL: https://arxiv.org/abs/1711.07135

zbMATH Keywords

Schlegel diagramchromatic subdivisionprogram specializationimmediate snapshot protocol

Mathematics Subject Classification ID

General topology of complexes (57Q05) Distributed systems (68M14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Asynchronous computability theorems for \(t\)-resilient systems
• Chromatic subdivision of a simplicial complex
• The Read/Write Protocol Complex Is Collapsible
• A generalized asynchronous computability theorem
• The Combinatorial Structure of Wait-Free Solvable Tasks
• The topological structure of asynchronous computability
• Read-Write Memory and k-Set Consensus as an Affine Task
• Toward a Topological Characterization of Asynchronous Complexity
• Lectures on Polytopes
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Set consensus using arbitrary objects (preliminary version)
• A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
• Immediate atomic snapshots and fast renaming
• Combinatorial algebraic topology

This page was built for publication: Schlegel Diagram and Optimizable Immediate Snapshot Protocol