Practical implementations of non-blocking synchronization primitives
From MaRDI portal
Publication:5361485
DOI10.1145/259380.259442zbMath1373.68114OpenAlexW2013021588MaRDI QIDQ5361485
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
Related Items
A general lock-free algorithm using compare-and-swap, Power and limits of distributed computing shared memory models, RMR-efficient implementations of comparison primitives using read and write operations, Lock-free deques and doubly linked lists, Distributed transactional memory for metric-space networks, An optimistic approach to lock-free FIFO queues, Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions, Nonblocking \(k\)-compare-single-swap, Towards a practical snapshot algorithm, NB{\texttt{malloc}}: Allocating memory in a lock-free manner, A general technique for proving lock-freedom, Space lower bounds for the signal detection problem, Trace-based derivation of a scalable lock-free stack algorithm
