Concurrent lock-free unbounded priority queue with mutable priorities

DOI10.1007/978-3-030-03232-6_24MaRDI QIDQ6165850zbMATH OpenOpenAlexFDO

Authors Ivan Walulya, Bapi Chatterjee, Ajoy K. Datta, Rashmi Niyolia, Philippas Tsigas

Publication date 2 August 2023

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

Full work available at URL https://doi.org/10.1007/978-3-030-03232-6_24

zbMATH Keywords

concurrent heapeliminationheaplinearizabilitylock-freepriority-queue

Mathematics Subject Classification ID

Data structures (68P05) Distributed algorithms (68W15)

Recommendations

• A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms
• CBPQ: high performance lock-free priority queue
• Fast and lock-free concurrent priority queues for multi-thread systems
• An efficient algorithm for concurrent priority queue heaps
• A parallel priority queue with constant time operations

Cited in

(5)

• CBPQ: high performance lock-free priority queue
• Fast and lock-free concurrent priority queues for multi-thread systems
• Concurrent access of priority queues
• A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms
• TSLQueue: an efficient lock-free design for priority queues

This page was built for publication: Concurrent lock-free unbounded priority queue with mutable priorities

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