CBPQ: high performance lock-free priority queue

DOI10.1007/978-3-319-43659-3_34MaRDI QIDQ1693224zbMATH OpenOpenAlexFDO

Authors Anastasia Braginsky, Nachshon Cohen, Erez Petrank

Publication date 11 January 2018

Full work available at URL https://doi.org/10.1007/978-3-319-43659-3_34

zbMATH Keywords

freezinglock-freenon-blockingperformancepriority queue

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Data structures (68P05)

Recommendations

• Fast and lock-free concurrent priority queues for multi-thread systems
• TSLQueue: an efficient lock-free design for priority queues
• Concurrent lock-free unbounded priority queue with mutable priorities
• Power balance and apportionment algorithms for the United States Congress
• Randomized priority queues for fast parallel access
• Fast priority queues for cached memory
• Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues

Cited in

(6)

• An optimistic approach to lock-free FIFO queues
• CBPQ
• Parallel combining: benefits of explicit synchronization
• Power balance and apportionment algorithms for the United States Congress
• Concurrent lock-free unbounded priority queue with mutable priorities
• TSLQueue: an efficient lock-free design for priority queues

This page was built for publication: CBPQ: high performance lock-free priority queue

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