Built-in coloring for highly-concurrent doubly-linked lists
From MaRDI portal
Publication:2392250
Recommendations
Cites work
- scientific article; zbMATH DE number 1696666 (Why is no real title available?)
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- scientific article; zbMATH DE number 2006660 (Why is no real title available?)
- Bounds on contention management algorithms
- DCAS-based concurrent deques
- Disentangling multi-object operations (extended abstract)
- Efficient multi-word locking using randomization
- Highly concurrent multi-word synchronization
- Improved implementations of binary universal operations
- Lock-free deques and doubly linked lists
- Software transactional memory
- Thread scheduling for multiprogrammed multiprocessors
- Two-handed emulation, how to build non-blocking implementations of complex data-structures using DCAS
Cited in
(5)- Universal constructions that ensure disjoint-access parallelism and wait-freedom
- scientific article; zbMATH DE number 2006660 (Why is no real title available?)
- scientific article; zbMATH DE number 17818 (Why is no real title available?)
- Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
- Non-blocking doubly-linked lists with good amortized complexity
This page was built for publication: Built-in coloring for highly-concurrent doubly-linked lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2392250)