The renaming problem in shared memory systems: an introduction
From MaRDI portal
(Redirected from Publication:465682)
Recommendations
Cites work
- scientific article; zbMATH DE number 1696672 (Why is no real title available?)
- scientific article; zbMATH DE number 996442 (Why is no real title available?)
- scientific article; zbMATH DE number 1418337 (Why is no real title available?)
- A combinatorial characterization of the distributed 1-solvable tasks
- Adaptive and efficient algorithms for lattice agreement and renaming
- Algebraic spans
- An overview of synchronous message-passing and topology
- Atomic Snapshots in O (n log n) Operations
- Atomic snapshots of shared memory
- Exploring Gafni’s Reduction Land: From Ω k to Wait-Free Adaptive $(2p-\lceil\frac{p}{k}\rceil)$ -Renaming Via k-Set Agreement
- Failure detectors and the wait-free hierarchy (extended abstract)
- Failure detectors in loosely named systems
- From adaptive renaming to set agreement
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Group-Solvability
- Help When Needed, But No More: Efficient Read/Write Partial Snapshot
- Immediate atomic snapshots and fast renaming
- Impossibility of distributed consensus with one faulty process
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- New combinatorial topology bounds for renaming: the lower bound
- New combinatorial topology upper and lower bounds for renaming
- Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94
- Renaming in an asynchronous environment
- Subconsensus Tasks: Renaming Is Weaker Than Set Agreement
- The Combinatorial Structure of Wait-Free Solvable Tasks
- The topological structure of asynchronous computability
- Unreliable failure detectors for reliable distributed systems
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Wait-free algorithms for fast, long-lived renaming
Cited in
(21)- Asynchronous coordination under preferences and constraints
- Tasks in modular proofs of concurrent algorithms
- Simplicial models for the epistemic logic of faulty agents
- Power and limits of distributed computing shared memory models
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- A closer look at fault tolerance
- A simplicial complex model for dynamic epistemic logic to study distributed task computability
- A visit to mutual exclusion in seven dates
- Waiting in concurrent algorithms
- Naming symmetric processes using shared variables
- Renaming in an asynchronous environment
- Bounds on the step and namespace complexity of renaming
- Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+}
- The solvability of consensus in iterated models extended with safe-consensus
- Coordination without prior agreement
- From adaptive renaming to set agreement
- Tasks in modular proofs of concurrent algorithms
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- What can be computed in a distributed system?
- The renaming problem: recent developments and open questions
- scientific article; zbMATH DE number 7228882 (Why is no real title available?)
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)
