The renaming problem in shared memory systems: an introduction
DOI10.1016/J.COSREV.2011.04.001zbMATH Open1298.68049OpenAlexW2028117109MaRDI QIDQ465682FDOQ465682
Authors: Armando Castañeda, Sergio Rajsbaum, Michel Raynal 
Publication date: 24 October 2014
Published in: Computer Science Review (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00537914/file/PI-1960.pdf
Recommendations
lower boundsconsensusconcurrencyrecursionsymmetry breakingasynchronous systemcrash failureobstruction-freedomwait-freedomalgebraic topologyset agreementrenamingatomic snapshotread/write shared memory systemsplittertest\&setwrite-snapshot
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Nonnumerical algorithms (68W05) Distributed systems (68M14) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Renaming in an asynchronous environment
- Unreliable failure detectors for reliable distributed systems
- Impossibility of distributed consensus with one faulty process
- Atomic snapshots of shared memory
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- The topological structure of asynchronous computability
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Generalized FLP impossibility result for t-resilient asynchronous computations
- A combinatorial characterization of the distributed 1-solvable tasks
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
- Algebraic spans
- Immediate atomic snapshots and fast renaming
- Wait-free algorithms for fast, long-lived renaming
- New combinatorial topology upper and lower bounds for renaming
- The Combinatorial Structure of Wait-Free Solvable Tasks
- Atomic Snapshots in O (n log n) Operations
- From adaptive renaming to set agreement
- An overview of synchronous message-passing and topology
- Title not available (Why is that?)
- Adaptive and efficient algorithms for lattice agreement and renaming
- Failure detectors in loosely named systems
- Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94
- Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement
- Help When Needed, But No More: Efficient Read/Write Partial Snapshot
- Title not available (Why is that?)
- Failure detectors and the wait-free hierarchy (extended abstract)
- Group-Solvability
- New combinatorial topology bounds for renaming: the lower bound
Cited In (18)
- Power and limits of distributed computing shared memory models
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- A visit to mutual exclusion in seven dates
- Bounds on the Step and Namespace Complexity of Renaming
- Asynchronous Coordination Under Preferences and Constraints
- Waiting in concurrent algorithms
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- Tasks in modular proofs of concurrent algorithms
- Simplicial models for the epistemic logic of faulty agents
- What Can be Computed in a Distributed System?
- Title not available (Why is that?)
- From adaptive renaming to set agreement
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- A closer look at fault tolerance
- Renaming in an asynchronous environment
- Tasks in modular proofs of concurrent algorithms
- Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+}
- The solvability of consensus in iterated models extended with safe-consensus
This page was built for publication: The renaming problem in shared memory systems: an introduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q465682)
