A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
From MaRDI portal
Publication:5361482
DOI10.1145/259380.259439zbMath1374.68063OpenAlexW2016108929MaRDI QIDQ5361482
Publication date: 29 September 2017
Published in: Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/259380.259439
Related Items (23)
Collapsibility of read/write models using discrete Morse theory ⋮ An algorithmic approach to the asynchronous computability theorem ⋮ Structure theory of flip graphs with applications to weak symmetry breaking ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ The topology of distributed adversaries ⋮ Schlegel Diagram and Optimizable Immediate Snapshot Protocol ⋮ Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement ⋮ Power and limits of distributed computing shared memory models ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ Partial synchrony based on set timeliness ⋮ Why Extension-Based Proofs Fail ⋮ The Iterated Restricted Immediate Snapshot Model ⋮ Hundreds of impossibility results for distributed computing ⋮ A simple characterization of asynchronous computations ⋮ Bounds on the Step and Namespace Complexity of Renaming ⋮ An Introduction to the Topological Theory of Distributed Computing with Safe-consensus ⋮ An impossibility about failure detectors in the iterated immediate snapshot model ⋮ New combinatorial topology bounds for renaming: the lower bound ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ Wait-free approximate agreement on graphs ⋮ Wait-free approximate agreement on graphs ⋮ t-Resilient Immediate Snapshot Is Impossible ⋮ A classification of wait-free loop agreement tasks
This page was built for publication: A simple algorithmically reasoned characterization of wait-free computation (extended abstract)
