Efficient and practical constructions of LL/SC variables
From MaRDI portal
Publication:2943765
DOI10.1145/872035.872078zbMath1321.68472OpenAlexW2034485694MaRDI QIDQ2943765
Prasad Jayanti, Srdjan Petrovic
Publication date: 4 September 2015
Published in: Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/872035.872078
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (4)
Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ A general lock-free algorithm using compare-and-swap ⋮ Efficient Bounded Timestamping from Standard Synchronization Primitives ⋮ Space lower bounds for the signal detection problem
Cites Work
This page was built for publication: Efficient and practical constructions of LL/SC variables
