Wait-free algorithms for fast, long-lived renaming
From MaRDI portal
Publication:1904367
DOI10.1016/0167-6423(95)00009-HzbMath0838.68050MaRDI QIDQ1904367
Publication date: 20 December 1995
Published in: Science of Computer Programming (Search for Journal in Brave)
Related Items (25)
Tight Bounds for Asynchronous Renaming ⋮ Computing with infinitely many processes ⋮ On the uncontended complexity of anonymous agreement ⋮ Tasks in modular proofs of concurrent algorithms ⋮ Efficient adaptive collect using randomization ⋮ Adaptive mutual exclusion with local spinning ⋮ Efficient adaptive collect algorithms ⋮ Renaming in synchronous message passing systems with Byzantine failures ⋮ The weakest failure detectors to boost obstruction-freedom ⋮ The renaming problem in shared memory systems: an introduction ⋮ A new fast-path mechanism for mutual exclusion ⋮ Long lived adaptive splitter and applications ⋮ An adaptive collect algorithm with applications ⋮ Adaptive and efficient mutual exclusion ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Fully-adaptive algorithms for long-lived renaming ⋮ A closer look at fault tolerance ⋮ The assignment problem ⋮ On the complexity of basic abstractions to implement consensus ⋮ Contention-sensitive data structures and algorithms ⋮ Strong order-preserving renaming in the synchronous message passing model ⋮ Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention ⋮ Wait-free solvability of colorless tasks in anonymous shared-memory model ⋮ Allocate-On-Use Space Complexity of Shared-Memory Algorithms
This page was built for publication: Wait-free algorithms for fast, long-lived renaming
