Built-in coloring for highly-concurrent doubly-linked lists

DOI10.1007/S00224-012-9420-5zbMATH Open1270.68095OpenAlexW1973769849MaRDI QIDQ2392250FDOQ2392250

Hagit Attiya, Eshcar Hillel

Publication date: 1 August 2013

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-012-9420-5

Recommendations

• Built-In Coloring for Highly-Concurrent Doubly-Linked Lists
• scientific article; zbMATH DE number 2006660
• Non-blocking doubly-linked lists with good amortized complexity
• Publication:2766861
• Lock-free deques and doubly linked lists

zbMATH Keywords

asynchronous shared memorypriority queueconcurrent data structuresdouble-ended queuedoubly-linked listlocal nonblocking implementations

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Thread scheduling for multiprogrammed multiprocessors
• Title not available (Why is that?)
• Software transactional memory
• Title not available (Why is that?)
• Lock-free deques and doubly linked lists
• Title not available (Why is that?)
• Two-handed emulation
• Bounds on contention management algorithms
• Improved implementations of binary universal operations
• Efficient multi-word locking using randomization
• Disentangling multi-object operations (extended abstract)
• Highly concurrent multi-word synchronization
• DCAS-based concurrent deques

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Universal constructions that ensure disjoint-access parallelism and wait-freedom
• Built-In Coloring for Highly-Concurrent Doubly-Linked Lists

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)