Are Lock-Free Concurrent Algorithms Practically Wait-Free?

DOI10.1145/2903136zbMath1410.68053arXiv1311.3200MaRDI QIDQ3177807

Nir Shavit, Keren Censor-Hillel, Dan Alistarh

Publication date: 2 August 2018

Published in: Journal of the ACM, Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.3200

zbMATH Keywords

distributed computing; shared memory; schedulers; progress properties; wait-free algorithms; lock-free algorithms; lockfree algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W10: Parallel algorithms in computer science

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68M14: Distributed systems

68W15: Distributed algorithms

Uses Software

• SuLQ