Wait-free algorithms for fast, long-lived renaming
From MaRDI portal
Publication:1904367
Recommendations
Cited in
(34)- Computing with infinitely many processes
- The renaming problem in shared memory systems: an introduction
- On the complexity of basic abstractions to implement consensus
- Allocate-on-use space complexity of shared-memory algorithms
- Fast, long-lived renaming improved and simplified
- Strong order-preserving renaming in the synchronous message passing model
- Randomized naming using wait-free shared variables
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- On the uncontended complexity of anonymous agreement
- Optimal parallel randomized renaming
- On the cost of uniform protocols whose memory consumption is adaptive to interval contention
- scientific article; zbMATH DE number 1555924 (Why is no real title available?)
- Shared-memory mutual exclusion: major research trends since 1986
- Renaming in synchronous message passing systems with Byzantine failures
- The assignment problem
- scientific article; zbMATH DE number 1696672 (Why is no real title available?)
- Tasks in modular proofs of concurrent algorithms
- Fully-Adaptive Algorithms for Long-Lived Renaming
- Adaptive mutual exclusion with local spinning
- An adaptive collect algorithm with applications
- Tight bounds for asynchronous renaming
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- scientific article; zbMATH DE number 2006648 (Why is no real title available?)
- Efficient adaptive collect using randomization
- A closer look at fault tolerance
- Tasks in modular proofs of concurrent algorithms
- A new fast-path mechanism for mutual exclusion
- Fully-adaptive algorithms for long-lived renaming
- The weakest failure detectors to boost obstruction-freedom
- Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+}
- Efficient adaptive collect algorithms
- Adaptive and efficient mutual exclusion
- Long lived adaptive splitter and applications
- Contention-sensitive data structures and algorithms
This page was built for publication: Wait-free algorithms for fast, long-lived renaming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1904367)
