Renaming in an asynchronous environment
From MaRDI portal
DOI10.1145/79147.79158zbMATH Open0699.68034OpenAlexW2023866984MaRDI QIDQ3477940FDOQ3477940
Authors: Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger 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
Recommendations
networkslower boundsymmetry breakingasynchronynetwork protocolsunreliable systemsasynchronous environmentcomputer-communicationprocessor renaming
Cited In (78)
- Computing with infinitely many processes
- Solving the at-most-once problem with nearly optimal effectiveness
- Power and limits of distributed computing shared memory models
- The renaming problem in shared memory systems: an introduction
- On modelling mobility
- Fast rendezvous on a cycle by agents with different speeds
- Topology recognition with advice
- Generating fast indulgent algorithms
- Asynchronous coordination under preferences and constraints
- Stability of long-lived consensus.
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- Strong order-preserving renaming in the synchronous message passing model
- Hundreds of impossibility results for distributed computing
- Weak symmetry breaking and abstract simplex paths
- Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
- A classification of wait-free loop agreement tasks
- A visit to mutual exclusion in seven dates
- On the importance of having an identity or, is consensus really universal?
- Waiting in concurrent algorithms
- Bounded delay for a free address
- Title not available (Why is that?)
- Renaming in synchronous message passing systems with Byzantine failures
- The assignment problem
- \(t\)-resilient immediate snapshot Is impossible
- Knowledge in shared memory systems.
- Locality and checkability in wait-free computing
- Locality and checkability in wait-free computing
- An adaptive collect algorithm with applications
- Deterministic multi-channel information exchange
- Algebraic topology and concurrency
- Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus
- Linear space bootstrap communication schemes
- Extending the wait-free hierarchy to multi-threaded systems
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
- Set agreement and renaming in the presence of contention-related crash failures
- Tight bounds for asynchronous renaming
- Closed schedulers: a novel technique for analyzing asynchronous protocols
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- From adaptive renaming to set agreement
- Renaming and the weakest family of failure detectors
- New combinatorial topology bounds for renaming: the lower bound
- An equivariance theorem with applications to renaming
- Fault-tolerant critical section management in asynchronous environments
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- A closer look at fault tolerance
- The topology of distributed adversaries
- An equivariance theorem with applications to renaming
- Renaming in Message Passing Systems with Byzantine Failures
- Fully-adaptive algorithms for long-lived renaming
- The solvability of consensus in iterated models extended with safe-consensus
- Adaptive and efficient mutual exclusion
- The BG distributed simulation algorithm
- Lock-free dynamic hash tables with open addressing
- Anonymous processors with synchronous shared memory: Monte Carlo algorithms
- Tight bounds on the round complexity of distributed 1-solvable tasks
- Wait-free implementations in message-passing systems
- Byzantine renaming in synchronous systems with \(t < N\)
- The renaming problem: recent developments and open questions
- Efficient and robust sharing of memory in message-passing systems (extended abstract)
- Simulating reliable links with unreliable links in the presence of process crashes
- The combinatorial structure of wait-free solvable tasks (extended abstract)
- Brief announcement: Asynchronous coordination with constraints and preferences
- Distributed name assignment in computer networks
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Topology recognition and leader election in colored networks
- From Renaming to Set Agreement
- Wait-freedom with advice
- Tasks in modular proofs of concurrent algorithms
- Algebraic topology and distributed computing
- Title not available (Why is that?)
- Oblivious Collaboration
- Distributed computing in the asynchronous LOCAL model
- Tasks in modular proofs of concurrent algorithms
- Bounds on the step and namespace complexity of renaming
- What can be computed in a distributed system?
- An inductive-style procedure for counting monochromatic simplexes of symmetric subdivisions with applications to distributed computing
- Progress-space tradeoffs in single-writer memory implementations
This page was built for publication: Renaming in an asynchronous environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477940)
