Highly concurrent multi-word synchronization

DOI10.1016/j.tcs.2010.12.049zbMath1211.68124OpenAlexW1967263307MaRDI QIDQ631787

Eshcar Hillel, Hagit Attiya

Publication date: 14 March 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.049

zbMATH Keywords

concurrent data structuresDCASlocal nonblockingmulti-word synchronization

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (2)

Built-in coloring for highly-concurrent doubly-linked lists ⋮ Universal constructions that ensure disjoint-access parallelism and wait-freedom

Cites Work

• Unnamed Item
• Improved implementations of binary universal operations
• Bounds on Contention Management Algorithms
• Software transactional memory
• Efficient multi-word locking using randomization
• Disjoint-access-parallel implementations of strong shared memory primitives
• Universal constructions for multi-object operations
• Disentangling multi-object operations (extended abstract)

This page was built for publication: Highly concurrent multi-word synchronization