Immediate atomic snapshots and fast renaming
From MaRDI portal
Publication:5365157
DOI10.1145/164051.164056zbMath1373.68078OpenAlexW2039966494MaRDI QIDQ5365157
Publication date: 29 September 2017
Published in: Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/164051.164056
Related Items (44)
Collapsibility of read/write models using discrete Morse theory ⋮ A visit to mutual exclusion in seven dates ⋮ Unnamed Item ⋮ Bounded delay for a free address ⋮ Tight Bounds for Asynchronous Renaming ⋮ 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 ⋮ A non-topological proof for the impossibility of \(k\)-set agreement ⋮ Power and limits of distributed computing shared memory models ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ Why Extension-Based Proofs Fail ⋮ The Iterated Restricted Immediate Snapshot Model ⋮ On the importance of having an identity or, is consensus really universal? ⋮ Common2 extended to stacks and unbounded concurrency ⋮ Renaming in synchronous message passing systems with Byzantine failures ⋮ Locality and checkability in wait-free computing ⋮ The renaming problem in shared memory systems: an introduction ⋮ Topology of the immediate snapshot complexes ⋮ Long lived adaptive splitter and applications ⋮ An adaptive collect algorithm with applications ⋮ Randomized two-process wait-free test-and-set ⋮ Hundreds of impossibility results for distributed computing ⋮ A simple characterization of asynchronous computations ⋮ Linear space bootstrap communication schemes ⋮ The assignment problem ⋮ 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 ⋮ Strong order-preserving renaming in the synchronous message passing model ⋮ Unnamed Item ⋮ New combinatorial topology bounds for renaming: the lower bound ⋮ Anti-\(\Omega \): the weakest failure detector for set agreement ⋮ Towards a practical snapshot algorithm ⋮ Untangling Partial Agreement: Iterated x-consensus Simulations ⋮ Wait-freedom with advice ⋮ Wait-free solvability of colorless tasks in anonymous shared-memory model ⋮ From adaptive renaming to set agreement ⋮ Wait-free approximate agreement on graphs ⋮ Asynchronous Coordination Under Preferences and Constraints ⋮ t-Resilient Immediate Snapshot Is Impossible ⋮ Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity
This page was built for publication: Immediate atomic snapshots and fast renaming
