TSLQueue: an efficient lock-free design for priority queues

DOI10.1007/978-3-030-85665-6_24MaRDI QIDQ6487195zbMATH OpenFDO

Authors Philippas Tsigas

Publication date 31 March 2022

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

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Fast and lock-free concurrent priority queues for multi-thread systems
• CBPQ: high performance lock-free priority queue
• A comparative study of parallel and sequential priority queue algorithms
• Concurrent lock-free unbounded priority queue with mutable priorities
• Power balance and apportionment algorithms for the United States Congress

Cites work

• A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms
• An efficient algorithm for concurrent priority queue heaps
• CBPQ: high performance lock-free priority queue
• Fast and lock-free concurrent priority queues for multi-thread systems
• scientific article; zbMATH DE number 2006660 (Why is no real title available?)
• Lock-free linked lists using compare-and-swap
• Parallel heap: an optimal parallel priority queue
• The amortized complexity of non-blocking binary search trees

Cited in

(5)

• CBPQ: high performance lock-free priority queue
• Fast and lock-free concurrent priority queues for multi-thread systems
• NUMASK: high performance scalable skip list for NUMA
• scientific article; zbMATH DE number 2188502 (Why is no real title available?)
• A simple yet exact analysis of the MultiQueue

This page was built for publication: TSLQueue: an efficient lock-free design for priority queues

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