Adaptive and efficient mutual exclusion (extended abstract)
From MaRDI portal
Publication:5176775
DOI10.1145/343477.343525zbMath1314.68366OpenAlexW1979464238MaRDI QIDQ5176775
Publication date: 3 March 2015
Published in: Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/343477.343525
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (10)
Tight Bounds for Asynchronous Renaming ⋮ An improved lower bound for the time complexity of mutual exclusion ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ Efficient adaptive collect using randomization ⋮ Nonatomic mutual exclusion with local spinning ⋮ Adaptive mutual exclusion with local spinning ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Closing the complexity gap between FCFS mutual exclusion and mutual exclusion ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention ⋮ A space- and time-efficient local-spin spin lock.
This page was built for publication: Adaptive and efficient mutual exclusion (extended abstract)
