Efficient and practical constructions of LL/SC variables
From MaRDI portal
Publication:2943765
Recommendations
Cited in
(11)- Improved implementations of binary universal operations
- scientific article; zbMATH DE number 2089382 (Why is no real title available?)
- Space lower bounds for the signal detection problem
- Lower bounds on the amortized time complexity of shared objects
- 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)