Wait-free algorithms for fast, long-lived renaming
From MaRDI portal
Publication:1904367
DOI10.1016/0167-6423(95)00009-HzbMATH Open0838.68050MaRDI QIDQ1904367FDOQ1904367
Authors: Mark Moir, James H. Anderson
Publication date: 20 December 1995
Published in: Science of Computer Programming (Search for Journal in Brave)
Recommendations
Cited In (32)
- Computing with infinitely many processes
- The renaming problem in shared memory systems: an introduction
- On the complexity of basic abstractions to implement consensus
- Fast, long-lived renaming improved and simplified
- Strong order-preserving renaming in the synchronous message passing model
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- On the uncontended complexity of anonymous agreement
- On the cost of uniform protocols whose memory consumption is adaptive to interval contention
- Title not available (Why is that?)
- Shared-memory mutual exclusion: major research trends since 1986
- Renaming in synchronous message passing systems with Byzantine failures
- The assignment problem
- Tasks in modular proofs of concurrent algorithms
- Title not available (Why is that?)
- Fully-Adaptive Algorithms for Long-Lived Renaming
- An adaptive collect algorithm with applications
- Adaptive mutual exclusion with local spinning
- Tight bounds for asynchronous renaming
- Allocate-On-Use Space Complexity of Shared-Memory Algorithms
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- A closer look at fault tolerance
- Title not available (Why is that?)
- Efficient adaptive collect using randomization
- Tasks in modular proofs of concurrent algorithms
- A new fast-path mechanism for mutual exclusion
- The weakest failure detectors to boost obstruction-freedom
- Fully-adaptive algorithms for long-lived renaming
- 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)