Pages that link to "Item:Q5361485"
From MaRDI portal
The following pages link to Practical implementations of non-blocking synchronization primitives (Q5361485):
Displaying 13 items.
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- Lock-free deques and doubly linked lists (Q436838) (← links)
- A general lock-free algorithm using compare-and-swap (Q865625) (← links)
- A general technique for proving lock-freedom (Q1001810) (← links)
- Trace-based derivation of a scalable lock-free stack algorithm (Q1019022) (← links)
- RMR-efficient implementations of comparison primitives using read and write operations (Q1938362) (← links)
- Distributed transactional memory for metric-space networks (Q1954240) (← links)
- An optimistic approach to lock-free FIFO queues (Q1954254) (← links)
- Space lower bounds for the signal detection problem (Q2048203) (← links)
- Nonblocking \(k\)-compare-single-swap (Q2272205) (← links)
- Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions (Q5138361) (← links)
- Towards a practical snapshot algorithm (Q5958615) (← links)
- NB{\texttt{malloc}}: Allocating memory in a lock-free manner (Q5961972) (← links)
