Improving fast mutual exclusion
From MaRDI portal
Publication:5348848
DOI10.1145/135419.135453zbMath1369.68058OpenAlexW1983421343MaRDI QIDQ5348848
Publication date: 21 August 2017
Published in: Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/135419.135453
Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (11)
An improved lower bound for the time complexity of mutual exclusion ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ Nonatomic mutual exclusion with local spinning ⋮ Adaptive mutual exclusion with local spinning ⋮ Adaptive solutions to the mutual exclusion problem ⋮ A fast, scalable mutual exclusion algorithm ⋮ Fast timing-based algorithms ⋮ Long lived adaptive splitter and applications ⋮ Adaptive and efficient mutual exclusion ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
This page was built for publication: Improving fast mutual exclusion
