Efficient and practical constructions of LL/SC variables

DOI10.1145/872035.872078MaRDI QIDQ2943765zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Recommendations

• Distributed Computing – IWDC 2005
• Computer Aided Verification
• Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions
• A general lock-free algorithm using compare-and-swap
• Pragmatic primitives for non-blocking data structures

Cited in

(13)

• Space lower bounds for the signal detection problem
• Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
• scientific article; zbMATH DE number 2089382 (Why is no real title available?)
• Improved implementations of binary universal operations
• Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions
• Distributed Computing – IWDC 2005
• Efficient Bounded Timestamping from Standard Synchronization Primitives
• Ll/SC and atomic copy: constant time, space efficient implementations using only pointer-width CAS
• Lower bounds on the amortized time complexity of shared objects
• Executable contracts for Elixir
• Efficient bounded timestamping from standard synchronization primitives
• Strongly linearizable LL/SC from CAS
• 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)