An Optimistic Approach to Lock-Free FIFO Queues

DOI10.1007/978-3-540-30186-8_9MaRDI QIDQ5464215zbMATH OpenOpenAlexFDO

Authors Edya Ladan-Mozes, Nir Shavit

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_9

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• An optimistic approach to lock-free FIFO queues
• The M/G/∞ Queueing Model for Optimistic Concurrency Control
• A Single-Enqueuer Wait-Free Queue Implementation
• scientific article; zbMATH DE number 1239514

Cited in

(6)

• Tight bounds for shared memory systems accessed by Byzantine processes
• An optimistic approach to lock-free FIFO queues
• Lock-free deques and doubly linked lists
• Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues
• Principles of Distributed Systems
• Brief announcement: Jiffy: a fast, memory efficient, wait-free multi-producers single-consumer queue

This page was built for publication: An Optimistic Approach to Lock-Free FIFO Queues

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