Nonblocking Concurrent Data Structures with Condition Synchronization

DOI10.1007/978-3-540-30186-8_13MaRDI QIDQ5464192zbMATH OpenOpenAlexFDO

Authors William N. Scherer III, Michael L. Scott

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-30186-8_13

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Local linearizability for concurrent container-type data structures
• On the inherent weakness of conditional synchronization primitives
• Pragmatic primitives for non-blocking data structures
• scientific article; zbMATH DE number 1263230
• Abstraction for Concurrent Objects

Cited in

(6)

• Consistency in nondeterministic storage
• An optimistic approach to lock-free FIFO queues
• Fast and scalable rendezvousing
• Two-handed emulation, how to build non-blocking implementations of complex data-structures using DCAS
• Tasks in modular proofs of concurrent algorithms
• Tasks in modular proofs of concurrent algorithms

This page was built for publication: Nonblocking Concurrent Data Structures with Condition Synchronization

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