Synchronizing without locks is inherently expensive

DOI10.1145/1146381.1146427zbMath1314.68151OpenAlexW2022496431MaRDI QIDQ5177292

Danny Hendler, Petr Kuznetsov, Hagit Attiya, Rachid Guerraoui

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1146381.1146427

zbMATH Keywords

lower boundmemory contentionobstruction-freedomperturbable objectsstep contentionlock-free implementations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

This page was built for publication: Synchronizing without locks is inherently expensive