scientific article; zbMATH DE number 2013836

MaRDI QIDQ4437129zbMATH OpenFDO

Authors Timothy L. Harris, Keir Fraser, Ian Pratt

Publication date 7 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2508/25080265.htm

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• Nonblocking \(k\)-compare-single-swap
• Pragmatic primitives for non-blocking data structures
• Two-handed emulation, how to build non-blocking implementations of complex data-structures using DCAS
• Highly-Concurrent Multi-word Synchronization
• Highly concurrent multi-word synchronization

Cited in

(15)

• Shared-object system equilibria: delay and throughput analysis
• Concurrent disjoint set union
• Nonblocking \(k\)-compare-single-swap
• Of concurrent data structures and iterations
• Lock-free deques and doubly linked lists
• Concurrent Robin Hood hashing
• Two-handed emulation, how to build non-blocking implementations of complex data-structures using DCAS
• Pragmatic primitives for non-blocking data structures
• Highly-Concurrent Multi-word Synchronization
• Strict linearizability and abstract atomicity
• Highly concurrent multi-word synchronization
• Efficient multi-word compare and swap
• Inherent limitations on disjoint-access parallel implementations of transactional memory
• Visibility and separability for a declarative linearizability proof of the timestamped stack
• Faster randomized repeated choice and DCAS

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4437129)