Fast and lock-free concurrent priority queues for multi-thread systems
From MaRDI portal
Recommendations
- Concurrent lock-free unbounded priority queue with mutable priorities
- Engineering MultiQueues: Fast Relaxed Concurrent Priority Queues
- Concurrent access of priority queues
- TSLQueue: an efficient lock-free design for priority queues
- A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms
- Randomized priority queues for fast parallel access
- Power balance and apportionment algorithms for the United States Congress
- An efficient algorithm for concurrent priority queue heaps
Cited in
(17)- Supporting lock-free synchronization in Pfair-scheduled real-time systems
- Concurrent access of priority queues
- Non-blocking timeout in scalable queue-based spin locks
- Lock-free concurrent binomial heaps
- Concurrent linearizable nearest neighbour search in LockFree-kD-tree
- scientific article; zbMATH DE number 1696666 (Why is no real title available?)
- Lock-free deques and doubly linked lists
- Lock-free search data structures: throughput modeling with Poisson processes
- A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms
- Power balance and apportionment algorithms for the United States Congress
- Extending the wait-free hierarchy to multi-threaded systems
- NB{\texttt{malloc}}: Allocating memory in a lock-free manner
- Concurrent lock-free unbounded priority queue with mutable priorities
- Brief announcement: Jiffy: a fast, memory efficient, wait-free multi-producers single-consumer queue
- TSLQueue: an efficient lock-free design for priority queues
- CBPQ: high performance lock-free priority queue
- Dealing with Priorities and Locks for Concurrent Programs
This page was built for publication: Fast and lock-free concurrent priority queues for multi-thread systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779732)
