A pragmatic implementation of non-blocking linked-lists
From MaRDI portal
Recommendations
Cited in
(39)- Speeding Lamport's fast mutual exclusion algorithm
- Non-blocking Patricia tries with replace operations
- An efficient approach to achieve compositionality using optimized multi-version object based transactional systems
- The amortized analysis of a non-blocking chromatic tree
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree
- Nonblocking \(k\)-compare-single-swap
- Built-in coloring for highly-concurrent doubly-linked lists
- On the correctness of a lock-free compression-based elastic mechanism for a hash trie design
- In the search for optimal concurrency
- A concurrent implementation of skip graphs
- Abstract specifications for concurrent maps
- Liveness-Preserving Atomicity Abstraction
- Lower bounds on the amortized time complexity of shared objects
- Shadowed management of free disk pages with a linked list
- Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
- scientific article; zbMATH DE number 17818 (Why is no real title available?)
- Lock-free deques and doubly linked lists
- Local reasoning for global graph properties
- Order out of chaos: proving linearizability using local views
- The amortized analysis of a non-blocking chromatic tree
- Lock-free search data structures: throughput modeling with Poisson processes
- Concurrent Robin Hood hashing
- Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions
- Pragmatic primitives for non-blocking data structures
- Leaplist: lessons learned in designing TM-supported range queries
- Contention-sensitive data structures and algorithms
- Performance issues in non-blocking synchronization on shared-memory multiprocessors
- Wait-free concurrent graph objects with dynamic traversals
- Non-blocking doubly-linked lists with good amortized complexity
- NB{\texttt{malloc}}: Allocating memory in a lock-free manner
- The limits of helping in non-volatile memory data structures
- Automated flaw detection in algebraic specifications
- The ERA Theorem for Safe Memory Reclamation
- Parallel implementations of Brunotte's algorithm
- TSLQueue: an efficient lock-free design for priority queues
- Make flows small again: revisiting the flow framework
- Achieving starvation-freedom with greater concurrency in multi-version object-based transactional memory systems
- Lower bounds on the amortized time complexity of shared objects
- Inductive predicates via least fixpoints in higher-order separation logic
This page was built for publication: A pragmatic implementation of non-blocking linked-lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4436059)
