An optimistic approach to lock-free FIFO queues

DOI10.1007/s00446-007-0050-0zbMath1266.68099OpenAlexW1994484216WikidataQ56480195 ScholiaQ56480195MaRDI QIDQ1954254

Nir Shavit, Edya Ladan-Mozes

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-007-0050-0

zbMATH Keywords

synchronizationcompare and swapnon-blockinglock-freeconcurrent data structuresCASFIFO queue

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Data structures (68P05) Algorithms in computer science (68W99)

Related Items

A Wait-free Queue with Polylogarithmic Step Complexity

Uses Software

• JSR-166

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
• DCAS-based concurrent deques
• Specifying Concurrent Program Modules
• Atomic snapshots of shared memory
• Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
• Lock-free linked lists using compare-and-swap
• Practical implementations of non-blocking synchronization primitives
• Nonblocking Concurrent Data Structures with Condition Synchronization
• Distributed Computing