Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues

DOI10.1142/S0129626417500013MaRDI QIDQ4598936zbMATH OpenOpenAlexWikidataFDO

Authors Panagiota Fatourou, Yiannis Nikolakopoulos, Marina Papatriantafilou

Publication date 15 December 2017

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129626417500013

zbMATH Keywords

concurrencydequedouble-ended queueiterationlock-freewait-free

Mathematics Subject Classification ID

Distributed systems (68M14) Data structures (68P05)

Recommendations

• Queue based mutual exclusion with linearly bounded overtaking
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• On Finite Capacity Processor-Shared Queues
• Nontrivial and universal helping for wait-free queues and stacks
• A Single-Enqueuer Wait-Free Queue Implementation
• An optimistic approach to lock-free FIFO queues
• An Optimistic Approach to Lock-Free FIFO Queues
• Checking linearizability of concurrent priority queues
• Double-ended queues with non-Poisson inputs and their effective algorithms

Cited in

(6)

• DCAS-based concurrent deques
• Of concurrent data structures and iterations
• Data-Structural Bootstrapping, Linear Path Compression, and Catenable Heap-Ordered Double-Ended Queues
• Wait-free concurrent graph objects with dynamic traversals
• A Single-Enqueuer Wait-Free Queue Implementation
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science

This page was built for publication: Linearizable Wait-Free Iteration Operations in Shared Double-Ended Queues

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