Renaming in an asynchronous environment
From MaRDI portal
Publication:3477940
DOI10.1145/79147.79158zbMath0699.68034OpenAlexW2023866984MaRDI QIDQ3477940
Amotz Bar-Noy, Hagit Attiya, Danny Dolev, David Peleg, K. Ruediger Reischuk
Publication date: 1990
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/79147.79158
networkslower boundsymmetry breakingnetwork protocolsasynchronyunreliable systemsasynchronous environmentcomputer-communicationprocessor renaming
Related Items (62)
An Equivariance Theorem with Applications to Renaming ⋮ A visit to mutual exclusion in seven dates ⋮ Unnamed Item ⋮ Bounded delay for a free address ⋮ Tight Bounds for Asynchronous Renaming ⋮ Deterministic multi-channel information exchange ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ Extending the wait-free hierarchy to multi-threaded systems ⋮ The topology of distributed adversaries ⋮ Progress-Space Tradeoffs in Single-Writer Memory Implementations ⋮ Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms ⋮ Solving the at-most-once problem with nearly optimal effectiveness ⋮ Computing with infinitely many processes ⋮ Power and limits of distributed computing shared memory models ⋮ Tasks in modular proofs of concurrent algorithms ⋮ The solvability of consensus in iterated models extended with safe-consensus ⋮ A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment ⋮ Renaming and the weakest family of failure detectors ⋮ Stability of long-lived consensus. ⋮ Lock-free dynamic hash tables with open addressing ⋮ Renaming in synchronous message passing systems with Byzantine failures ⋮ Locality and checkability in wait-free computing ⋮ Waiting in concurrent algorithms ⋮ The renaming problem in shared memory systems: an introduction ⋮ Closed schedulers: a novel technique for analyzing asynchronous protocols ⋮ Using local-spin k -exclusion algorithms to improve wait-free object implementations ⋮ The BG distributed simulation algorithm ⋮ An adaptive collect algorithm with applications ⋮ Adaptive and efficient mutual exclusion ⋮ Hundreds of impossibility results for distributed computing ⋮ Linear space bootstrap communication schemes ⋮ Fully-adaptive algorithms for long-lived renaming ⋮ An equivariance theorem with applications to renaming ⋮ A closer look at fault tolerance ⋮ Fault-tolerant critical section management in asynchronous environments ⋮ The assignment problem ⋮ Tight bounds on the round complexity of distributed 1-solvable tasks ⋮ Bounds on the Step and Namespace Complexity of Renaming ⋮ Generating fast indulgent algorithms ⋮ What Can be Computed in a Distributed System? ⋮ Weak symmetry breaking and abstract simplex paths ⋮ An Inductive-style Procedure for Counting Monochromatic Simplexes of Symmetric Subdivisions with Applications to Distributed Computing ⋮ Strong order-preserving renaming in the synchronous message passing model ⋮ Algebraic topology and concurrency ⋮ New combinatorial topology bounds for renaming: the lower bound ⋮ Topology recognition and leader election in colored networks ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects ⋮ Wait-freedom with advice ⋮ Wait-free solvability of colorless tasks in anonymous shared-memory model ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ From adaptive renaming to set agreement ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ Locality and Checkability in Wait-Free Computing ⋮ Oblivious Collaboration ⋮ Asynchronous Coordination Under Preferences and Constraints ⋮ t-Resilient Immediate Snapshot Is Impossible ⋮ On modelling mobility ⋮ Wait-free implementations in message-passing systems ⋮ Knowledge in shared memory systems. ⋮ Topology recognition with advice ⋮ A classification of wait-free loop agreement tasks ⋮ Fast rendezvous on a cycle by agents with different speeds
This page was built for publication: Renaming in an asynchronous environment
