Practical implementations of non-blocking synchronization primitives

DOI10.1145/259380.259442MaRDI QIDQ5361485zbMATH OpenOpenAlexFDO

Authors Mark Moir

Publication date 29 September 2017

Published in Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Distributed systems (68M14)

Cited in

(15)

• A general technique for proving lock-freedom
• Trace-based derivation of a scalable lock-free stack algorithm
• RMR-efficient implementations of comparison primitives using read and write operations
• Distributed transactional memory for metric-space networks
• An optimistic approach to lock-free FIFO queues
• Space lower bounds for the signal detection problem
• Nonblocking \(k\)-compare-single-swap
• Power and limits of distributed computing shared memory models
• Lock-free deques and doubly linked lists
• Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions
• Towards a practical snapshot algorithm
• NB{\texttt{malloc}}: Allocating memory in a lock-free manner
• Lower bounds on the amortized time complexity of shared objects
• Strongly linearizable LL/SC from CAS
• A general lock-free algorithm using compare-and-swap

This page was built for publication: Practical implementations of non-blocking synchronization primitives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361485)