Efficient and practical constructions of LL/SC variables
DOI10.1145/872035.872078zbMATH Open1321.68472OpenAlexW2034485694MaRDI QIDQ2943765FDOQ2943765
Authors: Prasad Jayanti, Srdjan Petrovic Edit this on Wikidata
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
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
Cited In (11)
- Improved implementations of binary universal operations
- Title not available (Why is that?)
- Lower bounds on the amortized time complexity of shared objects
- Space lower bounds for the signal detection problem
- Efficient Bounded Timestamping from Standard Synchronization Primitives
- Distributed Computing – IWDC 2005
- Executable contracts for Elixir
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
- Ll/SC and atomic copy: constant time, space efficient implementations using only pointer-width CAS
- Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions
- A general lock-free algorithm using compare-and-swap
This page was built for publication: Efficient and practical constructions of LL/SC variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943765)